( en | de | ru )

 

Disambiguation of "Raigorodskii, Andrei M."

Author of the publication

copydeleteadd this publication to your clipboard
On the stability of the Erdős-Ko-Rado theorem.

, , and . J. Comb. Theory A, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrei M Bandalouski

Andrei Negoescu

Andrei Lehmann

Andrei Belitski

Andrei Verbovsky

 

Other publications of authors with the same name

New bounds on clique-chromatic numbers of Johnson graphs., and . Discret. Appl. Math., (2020)Models of Random Graphs and Their Applications to the Web-Graph Analysis.. RuSSIR, volume 573 of Communications in Computer and Information Science, page 101-118. Springer, (2015)Distances in Higher-Order Networks and the Metric Structure of Hypergraphs., , , , , , and . Entropy, 25 (6): 923 (June 2023)A Statistical Test of Heterogeneous Subgraph Densities to Assess Clusterability., , , and . LION, volume 11968 of Lecture Notes in Computer Science, page 17-29. Springer, (2019)Recency-sensitive model of web page authority., , , , and . CIKM, page 2627-2630. ACM, (2012)Small subgraphs in preferential attachment networks.. Optim. Lett., 11 (2): 249-257 (2017)Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods., , , , , , , and . NIPS, page 4907-4915. (2016)Statistical power, accuracy, reproducibility and robustness of a graph clusterability test., , and . Int. J. Data Sci. Anal., 15 (4): 379-390 (May 2023)Coloring some finite sets in Rn ., , and . Discussiones Mathematicae Graph Theory, 33 (1): 25-31 (2013)Cliques and cycles in distance graphs and graphs of diameters.. Discrete Geometry and Algebraic Combinatorics, volume 625 of Contemporary Mathematics, American Mathematical Society, (2013)