|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
1. |
E. A. Neustroeva, A. M. Raigorodskii, “Estimates of the Number of Edges in Subgraphs of Johnson Graphs”, Mat. Zametki, 115:2 (2024), 266–275 ; Math. Notes, 115:2 (2024), 223–231 |
1
|
2. |
N. A. Dubinin, E. A. Neustroeva, A. M. Raigorodskii, Ya. K. Shubin, “Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph”, Mat. Sb., 215:5 (2024), 71–95 ; Sb. Math., 215:5 (2024), 634–657 |
|
2023 |
3. |
D. A. Skachkov, S. I. Gladyshev, A. M. Raigorodskii, “Experimental comparison of PageRank vector calculation algorithms”, Computer Research and Modeling, 15:2 (2023), 369–379 |
4. |
I. A. Samoylenko, I. V. Kuleshov, A. M. Raigorodskii, “The model of two-level intergroup competition”, Computer Research and Modeling, 15:2 (2023), 355–368 |
|
2022 |
5. |
A. V. Alpatov, E. A. Peters, D. A. Pasechnyuk, A. M. Raigorodskii, “Stochastic optimization in digital pre-distortion of the signal”, Computer Research and Modeling, 14:2 (2022), 399–416 |
2
|
6. |
V. S. Karas, A. M. Raigorodskii, “Erratum to: On Ramsey numbers for arbitrary sequences of graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 507 (2022), 485 ; Dokl. Math., 106:3 (2022), 485 |
7. |
V. S. Karas, A. M. Raigorodskii, “On Ramsey numbers for arbitrary sequences of graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 502 (2022), 19–22 ; Dokl. Math., 105:1 (2022), 14–17 |
8. |
A. M. Raigorodskii, “Asymptotics of the independence number of a random subgraph of the graph $G(n,r,{<}s)$”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 205 (2022), 16–21 |
9. |
A. M. Raigorodskii, V. S. Karas, “Asymptotics of the Independence Number of a Random Subgraph of the Graph $G(n,r,<s)$”, Mat. Zametki, 111:1 (2022), 107–116 ; Math. Notes, 111:1 (2022), 124–131 |
2
|
|
2021 |
10. |
Ph. A. Pushnyakov, A. M. Raigorodskii, “Estimate of the number of edges in subgraphs of a Johnson graph”, Dokl. RAN. Math. Inf. Proc. Upr., 499 (2021), 40–43 ; Dokl. Math., 104:1 (2021), 193–195 |
7
|
11. |
V. S. Karas, P. A. Ogarok, A. M. Raigorodskii, “Asymptotics of the independence number of a random subgraph of the graph $G(n,r,<s)$”, Dokl. RAN. Math. Inf. Proc. Upr., 499 (2021), 17–19 ; Dokl. Math., 104:1 (2021), 173–174 |
1
|
12. |
A. V. Berdnikov, A. M. Raigorodskii, “Bounds on Borsuk numbers in distance graphs of a special type”, Probl. Peredachi Inf., 57:2 (2021), 44–50 ; Problems Inform. Transmission, 57:2 (2021), 136–142 |
8
|
|
2020 |
13. |
A. M. Raigorodskii, “On dividing sets into parts of smaller diameter”, Dokl. RAN. Math. Inf. Proc. Upr., 495 (2020), 74–77 ; Dokl. Math., 102:3 (2020), 510–512 |
4
|
14. |
A. M. Raigorodskii, M. Koshelev, “New bounds for the clique-chromatic numbers of Johnson graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 490 (2020), 78–80 ; Dokl. Math., 101:1 (2020), 66–67 |
10
|
15. |
M. M. Ipatov, M. Koshelev, A. M. Raigorodskii, “Modularity of some distance graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 490 (2020), 71–73 ; Dokl. Math., 101:1 (2020), 60–61 |
9
|
16. |
A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “A Generalization of Kneser Graphs”, Mat. Zametki, 107:3 (2020), 351–365 ; Math. Notes, 107:3 (2020), 392–403 |
13
|
17. |
Ph. A. Pushnyakov, A. M. Raigorodskii, “Estimate of the Number of Edges in Special Subgraphs of a Distance Graph”, Mat. Zametki, 107:2 (2020), 286–298 ; Math. Notes, 107:2 (2020), 322–332 |
15
|
18. |
P. A. Ogarok, A. M. Raigorodskii, “On stability of the independence number of a certain distance graph”, Probl. Peredachi Inf., 56:4 (2020), 50–63 ; Problems Inform. Transmission, 56:4 (2020), 345–357 |
5
|
19. |
A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Uspekhi Mat. Nauk, 75:1(451) (2020), 95–154 ; Russian Math. Surveys, 75:1 (2020), 89–146 |
19
|
|
2019 |
20. |
K. D. Kovalenko, A. M. Raigorodskii, “Systems of Representatives”, Mat. Zametki, 106:3 (2019), 387–394 ; Math. Notes, 106:3 (2019), 372–377 |
2
|
21. |
L. I. Bogolubsky, A. M. Raigorodskii, “A Remark on Lower Bounds for the Chromatic Numbers of Spaces of Small Dimension with Metrics $\ell_1$ and $\ell_2$”, Mat. Zametki, 105:2 (2019), 187–213 ; Math. Notes, 105:2 (2019), 180–203 |
24
|
22. |
D. A. Zakharov, A. M. Raigorodskii, “Clique Chromatic Numbers of Intersection Graphs”, Mat. Zametki, 105:1 (2019), 142–144 ; Math. Notes, 105:1 (2019), 137–139 |
18
|
23. |
M. A. Fadin, A. M. Raigorodskii, “Maximum defect of an admissible octahedron in a rational lattice”, Uspekhi Mat. Nauk, 74:3(447) (2019), 191–192 ; Russian Math. Surveys, 74:3 (2019), 552–554 |
2
|
|
2018 |
24. |
A. Sokolov, A. M. Raigorodskiy, “On rational analogs of Nelson–Hadwiger's and Borsuk's problems”, Chebyshevskii Sb., 19:3 (2018), 270–281 |
2
|
25. |
A. M. Raigorodskii, T. V. Trukhan, “On the chromatic numbers of some distance graphs”, Dokl. Akad. Nauk, 482:6 (2018), 648–650 ; Dokl. Math., 98:2 (2018), 515–517 |
3
|
26. |
A. M. Raigorodskii, A. A. Sagdeev, “On a bound in extremal combinatorics”, Dokl. Akad. Nauk, 478:3 (2018), 271–273 ; Dokl. Math., 97:1 (2018), 47–48 |
9
|
|
2017 |
27. |
A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “On the number of edges of a uniform hypergraph with a range of allowed intersections”, Probl. Peredachi Inf., 53:4 (2017), 16–42 ; Problems Inform. Transmission, 53:4 (2017), 319–342 |
12
|
|
2016 |
28. |
A. M. Raigorodskii, “Графы с большим хроматическим числом и большим обхватом”, Mat. Pros., Ser. 3, 20 (2016), 228–237 |
29. |
Yu. A. Demidovich, A. M. Raigorodskii, “2-Colorings of Uniform Hypergraphs”, Mat. Zametki, 100:4 (2016), 623–626 ; Math. Notes, 100:4 (2016), 629–632 |
4
|
30. |
A. A. Bagan, A. M. Raigorodskii, “Defect of an Admissible Octahedron in a Centering of an Integer Lattice Generated by a Given Number of Vectors”, Mat. Zametki, 99:3 (2016), 457–459 ; Math. Notes, 99:3 (2016), 457–459 |
4
|
31. |
A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection”, Mat. Sb., 207:5 (2016), 17–42 ; Sb. Math., 207:5 (2016), 652–677 |
19
|
|
2015 |
32. |
A. V. Krot, A. M. Raigorodskii, “On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces”, Chebyshevskii Sb., 16:2 (2015), 133–143 |
33. |
D. G. Il'inskii, A. M. Raigorodskii, A. B. Skopenkov, “Независимость и доказательства существования в комбинаторике”, Mat. Pros., Ser. 3, 19 (2015), 164–177 |
34. |
A. M. Raigorodskii, “Lovász' Theorem on the Chromatic Number of Spheres Revisited”, Mat. Zametki, 98:3 (2015), 470–471 ; Math. Notes, 98:3 (2015), 522–524 |
10
|
35. |
A. A. Kokotkin, A. M. Raigorodskii, “On the Realization of Subgraphs of a Random Graph by Diameter Graphs in Euclidean Spaces”, Mat. Zametki, 97:5 (2015), 699–717 ; Math. Notes, 97:5 (2015), 709–724 |
36. |
E. I. Ponomarenko, A. M. Raigorodskii, “New Lower Bound for the Chromatic Number of a Rational Space with One and Two Forbidden Distances”, Mat. Zametki, 97:2 (2015), 255–261 ; Math. Notes, 97:2 (2015), 249–254 |
11
|
37. |
M. E. Zhukovskii, A. M. Raigorodskii, “Random graphs: models and asymptotic characteristics”, Uspekhi Mat. Nauk, 70:1(421) (2015), 35–88 ; Russian Math. Surveys, 70:1 (2015), 33–81 |
47
|
38. |
L. I. Bogolubsky, A. S. Gusev, M. M. Pyaderkin, A. M. Raigorodskii, “Independence numbers and chromatic numbers of the random subgraphs of some distance graphs”, Mat. Sb., 206:10 (2015), 3–36 ; Sb. Math., 206:10 (2015), 1340–1374 |
28
|
39. |
A. E. Zvonarev, A. M. Raigorodskii, “Improvements of the Frankl–Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle”, Trudy Mat. Inst. Steklova, 288 (2015), 109–119 ; Proc. Steklov Inst. Math., 288 (2015), 94–104 |
12
|
|
2014 |
40. |
A. V. Berdnikov, A. M. Raigorodskii, “On the Chromatic Number of Euclidean Space with Two Forbidden Distances”, Mat. Zametki, 96:5 (2014), 790–793 ; Math. Notes, 96:5 (2014), 827–830 |
4
|
41. |
E. I. Ponomarenko, A. M. Raigorodskii, “New Upper Bounds for the Independence Numbers of Graphs with Vertices in $\{-1,0,1\}^n$ and Their Applications to Problems of the Chromatic Numbers of Distance Graphs”, Mat. Zametki, 96:1 (2014), 138–147 ; Math. Notes, 96:1 (2014), 140–148 |
10
|
42. |
A. E. Zvonarev, A. M. Raigorodskii, D. V. Samirov, A. A. Kharlamova, “On the chromatic number of a space with forbidden equilateral triangle”, Mat. Sb., 205:9 (2014), 97–120 ; Sb. Math., 205:9 (2014), 1310–1333 |
17
|
|
2013 |
43. |
A. A. Kokotkin, A. M. Raigorodskii, “On large subgraphs with small chromatic numbers contained in distance graphs”, CMFD, 51 (2013), 64–73 ; Journal of Mathematical Sciences, 214:5 (2016), 665–674 |
1
|
44. |
D. V. Samirov, A. M. Raigorodskii, “New lower bounds for the chromatic number of a space with forbidden isosceles triangles”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 125 (2013), 252–268 ; J. Math. Sci. (N. Y.), 204:4 (2015), 531–541 |
4
|
45. |
A. M. Raigorodskii, D. V. Samirov, “Chromatic Numbers of Spaces with Forbidden Monochromatic Triangles”, Mat. Zametki, 93:1 (2013), 117–126 ; Math. Notes, 93:1 (2013), 163–171 |
8
|
46. |
E. I. Ponomarenko, A. M. Raigorodskii, “New estimates in the problem of the number of edges in a hypergraph with forbidden intersections”, Probl. Peredachi Inf., 49:4 (2013), 98–104 ; Problems Inform. Transmission, 49:4 (2013), 384–390 |
19
|
47. |
E. I. Ponomarenko, A. M. Raigorodskii, “A new lower bound for the chromatic number of the rational space”, Uspekhi Mat. Nauk, 68:5(413) (2013), 183–184 ; Russian Math. Surveys, 68:5 (2013), 960–962 |
7
|
48. |
A. B. Kupavskii, A. M. Raigorodskii, “Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii”, Mat. Sb., 204:10 (2013), 47–90 ; Sb. Math., 204:10 (2013), 1435–1479 |
4
|
49. |
E. E. Demekhin, A. M. Raigorodskii, O. I. Rubanov, “Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size”, Mat. Sb., 204:4 (2013), 49–78 ; Sb. Math., 204:4 (2013), 508–538 |
21
|
|
2012 |
50. |
A. M. Raigorodskii, “Задача Эрдёша – Гинзбурга – Зива и ее окрестности”, Mat. Pros., Ser. 3, 16 (2012), 132–144 |
|
2011 |
51. |
V. F. Moskva, A. M. Raigorodskii, “New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in $\{-1,0,1\}^n$”, Mat. Zametki, 89:2 (2011), 319–320 ; Math. Notes, 89:2 (2011), 307–308 |
5
|
52. |
A. M. Raigorodskii, D. A. Shabanov, “The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems”, Uspekhi Mat. Nauk, 66:5(401) (2011), 109–182 ; Russian Math. Surveys, 66:5 (2011), 933–1002 |
39
|
|
2010 |
53. |
A. M. Raigorodskii, O. I. Rubanov, “Distance Graphs with Large Chromatic Number and without Large Cliques”, Mat. Zametki, 87:3 (2010), 417–428 ; Math. Notes, 87:3 (2010), 392–402 |
10
|
54. |
A. B. Kupavskii, A. M. Raigorodskii, “Partition of Three-Dimensional Sets into Five Parts of Smaller Diameter”, Mat. Zametki, 87:2 (2010), 233–245 ; Math. Notes, 87:2 (2010), 218–229 |
6
|
|
2009 |
55. |
V. K. Lyubimov, A. M. Raigorodskii, “Lower bounds for the independence numbers of some distance graphs with vertices in $\{-1,0,1\}^n$”, Dokl. Akad. Nauk, 427:4 (2009), 458–460 ; Dokl. Math., 80:1 (2009), 547–549 |
4
|
56. |
S. V. Nagaeva, A. M. Raigorodskii, “On the realization of random graphs as distance graphs in spaces of fixed dimension”, Dokl. Akad. Nauk, 424:3 (2009), 315–317 ; Dokl. Math., 79:1 (2009), 63–65 |
2
|
57. |
A. È. Guterman, V. K. Lyubimov, A. M. Raigorodskii, S. A. Usachev, “On the Independence Number of Distance Graphs with Vertices in $\{-1,0,1\}^n$”, Mat. Zametki, 86:5 (2009), 794–796 ; Math. Notes, 86:5 (2009), 744–746 |
6
|
58. |
K. A. Mikhailov, A. M. Raigorodskii, “On the Ramsey numbers for complete distance graphs with vertices in $\{0,1\}^n$”, Mat. Sb., 200:12 (2009), 63–80 ; Sb. Math., 200:12 (2009), 1789–1806 |
19
|
59. |
E. S. Gorskaya, I. M. Mitricheva (Shitova), V. Yu. Protasov, A. M. Raigorodskii, “Estimating the chromatic numbers of Euclidean space by convex minimization methods”, Mat. Sb., 200:6 (2009), 3–22 ; Sb. Math., 200:6 (2009), 783–801 |
25
|
|
2008 |
60. |
A. M. Raĭgorodskiĭ, I. I. Timirova, “On the Nelson–Erdős–Hadwiger problem for a series of metric spaces”, Chebyshevskii Sb., 9:1 (2008), 158–168 |
1
|
61. |
A. B. Kupavskii, A. M. Raigorodskii, “On the chromatic number of $\mathbb R^9$”, Fundam. Prikl. Mat., 14:5 (2008), 139–154 ; J. Math. Sci., 163:6 (2009), 720–731 |
9
|
62. |
A. M. Raigorodskii, M. M. Kityaev, “On a Series of Problems Related to the Borsuk and Nelson–Erdős–Hadwiger Problems”, Mat. Zametki, 84:2 (2008), 254–272 ; Math. Notes, 84:2 (2008), 239–255 |
2
|
63. |
A. M. Raigorodskii, I. M. Shitova, “On the Chromatic Number of Euclidean Space and the Borsuk Problem”, Mat. Zametki, 83:4 (2008), 636–639 ; Math. Notes, 83:4 (2008), 579–582 |
3
|
64. |
A. M. Raigorodskii, I. M. Shitova, “Chromatic numbers of real and rational spaces with real or rational forbidden distances”, Mat. Sb., 199:4 (2008), 107–142 ; Sb. Math., 199:4 (2008), 579–612 |
24
|
|
2007 |
65. |
A. M. Raigorodskii, “Chromatic Numbers of Metric Spaces”, CMFD, 23 (2007), 165–168 ; Journal of Mathematical Sciences, 154:4 (2008), 624–627 |
66. |
A. M. Raigorodskii, “Around Borsuk's Hypothesis”, CMFD, 23 (2007), 147–164 ; Journal of Mathematical Sciences, 154:4 (2008), 604–623 |
58
|
67. |
A. M. Raigorodskii, “On Ramsey Numbers for Special Complete Distance Graphs”, Mat. Zametki, 82:3 (2007), 477–480 ; Math. Notes, 82:3 (2007), 426–429 |
1
|
68. |
N. G. Moshchevitin, A. M. Raigorodskii, “Colorings of the Space $\mathbb R^n$ with Several Forbidden Distances”, Mat. Zametki, 81:5 (2007), 733–743 ; Math. Notes, 81:5 (2007), 656–664 |
17
|
69. |
A. M. Raigorodskii, “On distance graphs with large chromatic number but without large simplices”, Uspekhi Mat. Nauk, 62:6(378) (2007), 187–188 ; Russian Math. Surveys, 62:6 (2007), 1224–1225 |
11
|
70. |
A. M. Raigorodskii, “On a problem in the geometry of numbers”, Tr. Inst. Mat., 15:1 (2007), 111–117 |
3
|
|
2006 |
71. |
A. M. Raigorodskii, “On the structure of distance graphs with large chromatic numbers”, Mat. Zametki, 80:3 (2006), 473–475 ; Math. Notes, 80:3 (2006), 451–453 |
1
|
72. |
A. M. Raigorodskii, “On the Borsuk and Erdös–Hadwiger numbers”, Mat. Zametki, 79:6 (2006), 913–924 ; Math. Notes, 79:6 (2006), 854–863 |
9
|
73. |
A. M. Raigorodskii, “The Nelson–Erdős–Hadwiger problem and a space realization of a random graph”, Uspekhi Mat. Nauk, 61:4(370) (2006), 195–196 ; Russian Math. Surveys, 61:4 (2006), 783–785 |
6
|
|
2005 |
74. |
A. M. Raigorodskii, “Хроматические числа дистанционных графов”, Chebyshevskii Sb., 6:3 (2005), 159–170 |
2
|
75. |
A. M. Raigorodskii, “О структуре графов расстояний, имеющих большое хроматическое число”, Chebyshevskii Sb., 6:3 (2005), 151–158 |
76. |
A. M. Raigorodskii, “Colorings of spaces, and random graphs”, Fundam. Prikl. Mat., 11:6 (2005), 131–141 ; J. Math. Sci., 146:2 (2007), 5723–5730 |
2
|
77. |
A. M. Raigorodskii, “The problems of Borsuk and Grünbaum on lattice polytopes”, Izv. RAN. Ser. Mat., 69:3 (2005), 81–108 ; Izv. Math., 69:3 (2005), 513–537 |
21
|
78. |
A. M. Raigorodskii, “The connection between the Borsuk and Erdös–Hadwiger problems”, Uspekhi Mat. Nauk, 60:4(364) (2005), 219–220 ; Russian Math. Surveys, 60:4 (2005), 796–798 |
5
|
79. |
A. M. Raigorodskii, “The Erdős–Hadwiger problem and the chromatic numbers of finite geometric graphs”, Mat. Sb., 196:1 (2005), 123–156 ; Sb. Math., 196:1 (2005), 115–146 |
25
|
|
2004 |
80. |
A. M. Raigorodskii, “The chromatic number of a space with the metric $l_q$”, Uspekhi Mat. Nauk, 59:5(359) (2004), 161–162 ; Russian Math. Surveys, 59:5 (2004), 973–975 |
36
|
81. |
A. M. Raigorodskii, “On lower bounds for Borsuk and Hadwiger numbers”, Uspekhi Mat. Nauk, 59:3(357) (2004), 177–178 ; Russian Math. Surveys, 59:3 (2004), 585–586 |
7
|
|
2003 |
82. |
A. M. Raigorodskii, “The Erdős–Hadwiger problem and the chromatic numbers of finite geometric graphs”, Dokl. Akad. Nauk, 392:3 (2003), 313–317 ; Dokl. Math., 68:2 (2003), 216–220 |
6
|
83. |
A. M. Raigorodskii, Yu. A. Kalnishkan, “On Borsuk"s Problem in $\mathbb R^3$”, Mat. Zametki, 74:1 (2003), 149–151 ; Math. Notes, 74:1 (2003), 144–146 |
5
|
|
2002 |
84. |
A. M. Raigorodskii, “The Borsuk and Hadwiger problems and systems of vectors with restrictions on scalar products”, Uspekhi Mat. Nauk, 57:3(345) (2002), 159–160 ; Russian Math. Surveys, 57:3 (2002), 606–607 |
8
|
85. |
A. M. Raigorodskii, “The Borsuk problem for integral polytopes”, Mat. Sb., 193:10 (2002), 139–160 ; Sb. Math., 193:10 (2002), 1535–1556 |
15
|
|
2001 |
86. |
A. M. Raigorodskii, “Borsuk's problem and the chromatic numbers of some metric spaces”, Uspekhi Mat. Nauk, 56:1(337) (2001), 107–146 ; Russian Math. Surveys, 56:1 (2001), 103–139 |
204
|
|
2000 |
87. |
A. M. Raigorodskii, “A Probabilistic Approach to the Problem of the Defects of Admissible Sets in a Lattice”, Mat. Zametki, 68:6 (2000), 910–916 ; Math. Notes, 68:6 (2000), 770–774 |
5
|
88. |
A. M. Raigorodskii, “On the chromatic number of a space”, Uspekhi Mat. Nauk, 55:2(332) (2000), 147–148 ; Russian Math. Surveys, 55:2 (2000), 351–352 |
109
|
|
1999 |
89. |
A. M. Raigorodskii, “Systems of common representatives”, Fundam. Prikl. Mat., 5:3 (1999), 851–860 |
14
|
90. |
A. M. Raigorodskii, “On a bound in Borsuk's problem”, Uspekhi Mat. Nauk, 54:2(326) (1999), 185–186 ; Russian Math. Surveys, 54:2 (1999), 453–454 |
46
|
|
1998 |
91. |
A. M. Raigorodskii, “The defects of admissible balls and octahedra in a lattice, and systems of generic representatives”, Mat. Sb., 189:6 (1998), 117–141 ; Sb. Math., 189:6 (1998), 931–954 |
9
|
|
1997 |
92. |
A. M. Raigorodskii, “On the dimension in Borsuk's problem”, Uspekhi Mat. Nauk, 52:6(318) (1997), 181–182 ; Russian Math. Surveys, 52:6 (1997), 1324–1325 |
43
|
|
|
|
2024 |
93. |
A. Raigorodskii, “Пересечения и раскраски”, Kvant, 2024, no. 5-6, 8–12 |
94. |
N. N. Andreev, S. E. Boichenko, S. O. Gorchinskiy, V. V. Kozlov, N. Yu. Lukoyanov, D. K. Mamyi, D. O. Orlov, A. M. Raigorodskii, “The Third Conference of Russian Mathematical Centers”, Uspekhi Mat. Nauk, 79:1(475) (2024), 191–194 ; Russian Math. Surveys, 79:1 (2024), 183–187 |
|
2023 |
95. |
N. H. Agakhanov, N. N. Andreev, S. N. Askhabov, N. M. Dobrovolsky, A. Domoshnitsky, S. A. Dorichenko, M. V. Zaitsev, I. A. Ivanov-Pogodaev, A. A. Kolchev, S. Malev, I. V. Mitrofanov, A. A. Mikhalev, S. P. Mishchenko, V. G. Navodnov, Yu. V. Nesterenko, A. M. Pesin, F. V. Petrov, S. V. Pchelintsev, A. M. Raigorodsky, Ph. D. Rukhovich, L. M. Samoilov, A. L. Semenov, V. A. Timorin, O. N. Tulupov, M. I. Kharitonov, A. L. Chernyatiev, A. A. Chilikov, V. N. Chubarikov, A. I. Shafarevich, “Alexey Yakovlevich Kanel-Belov”, Chebyshevskii Sb., 24:4 (2023), 380–400 |
96. |
A. Raigorodskii, “Еще об одной “олимпиадной” задаче про графы, или Еще одна задача о раскраске”, Kvant, 2023, no. 3, 14–19 |
|
2021 |
97. |
A. M. Raigorodskii, “Математика раскрасок”, Mat. Pros., Ser. 3, 27 (2021), 99–127 |
|
2019 |
98. |
A. Raigorodskii, “Одна задача о раскраске”, Kvant, 2019, no. 8, 15–22 |
|
2018 |
99. |
A. M. Raigorodskii, V. Voronov, A. Savvateev, “Прорыв в задаче о раскраске плоскости”, Kvant, 2018, no. 11, 2–9 |
100. |
A. M. Raigorodskii, “Остроугольные множества”, Kvant, 2018, no. 3, 10–13 |
|
2017 |
101. |
A. M. Raigorodskii, “Об одной «олимпиадной» задаче про графы”, Kvant, 2017, no. 2, 2–8 |
|
2016 |
102. |
A. Raigorodskii, “Задачи о пересечениях множеств”, Kvant, 2016, no. 5-6, 2–5 |
|
2015 |
103. |
A. Raigorodskii, L. Shabanov, “Об одной «олимпиадной» задаче про графы расстояний”, Kvant, 2015, no. 3, 7–10 |
|
2013 |
104. |
D. Il'inskii, A. Kupavskii, A. Raigorodskii, A. Skopenkov, “Дискретный анализ для математиков и программистов (подборка задач)”, Mat. Pros., Ser. 3, 17 (2013), 162–181 |
|
2012 |
105. |
A. Raigorodskii, “Математические модели интернета”, Kvant, 2012, no. 4, 12–16 |
1
|
|
2011 |
106. |
A. Raigorodskii, “Гипотеза Кнезера и топологический метод в комбинаторике”, Kvant, 2011, no. 1, 7–15 |
|
2010 |
107. |
I. V. Arzhantsev, V. I. Bogachev, A. A. Zaslavskii, V. Yu. Protassov, A. M. Raigorodskii, A. B. Skopenkov, “Студенческие олимпиады мехмата МГУ”, Mat. Pros., Ser. 3, 14 (2010), 225–234 |
|
2009 |
108. |
V. A. Koshelev, A. M. Raigorodskii, “Задача Эрдеша–Секереша: продолжение истории”, Kvant, 2009, no. 5, 13–18 |
109. |
V. Koshelev, A. Raigorodskii, “Задача Эрдеша–Секереша о выпуклых многоугольниках”, Kvant, 2009, no. 2, 6–13 |
|
2008 |
110. |
A. Raigorodskii, “Школа «Комбинаторная математика и теория алгоритмов»”, Kvant, 2008, no. 6, 59–60 |
111. |
A. Raigorodskii, O. Rubanov, V. Koshelev, “Хроматические числа”, Kvant, 2008, no. 3, 13–22 |
112. |
V. I. Bogachev, A. M. Raigorodskii, A. B. Skopenkov, N. A. Tolmachev, “Студенческие олимпиады и межкафедральный семинар на мехмате Московского государственного университета”, Mat. Pros., Ser. 3, 12 (2008), 205–222 |
|
Presentations in Math-Net.Ru |
1. |
Вероятность в комбинаторной геометрии. Семинар 3 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2024 July 29, 2024 15:30
|
2. |
Вероятность в комбинаторной геометрии. Семинар 2 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2024 July 26, 2024 09:30
|
3. |
Вероятность в комбинаторной геометрии. Семинар 1 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2024 July 25, 2024 17:15
|
4. |
Комбинаторика конечных множеств и случайные графы A. M. Raigorodskii
Main scientific seminar of the Innopolis University «Innopolis. Science» April 8, 2024 14:40
|
5. |
Графы Джонсона и их случайные подграфы. Семинар 3 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2023 July 28, 2023 15:30
|
6. |
Графы Джонсона и их случайные подграфы. Семинар 2 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2023 July 25, 2023 09:30
|
7. |
Графы Джонсона и их случайные подграфы. Семинар 1 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2023 July 22, 2023 09:30
|
8. |
Покрытия графов лесами и локальная лемма Ловаса. Семинар 3 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2022 July 28, 2022 09:30
|
9. |
Покрытия графов лесами и локальная лемма Ловаса. Семинар 2 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2022 July 27, 2022 17:15
|
10. |
Покрытия графов лесами и локальная лемма Ловаса. Семинар 1 A. M. Raigorodskii
Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2022 July 24, 2022 09:30
|
11. |
Complex networks and their applications in information search A. M. Raigorodskii
Actual Problems of Applied Mathematics May 13, 2022 17:00
|
12. |
Modularity in graphs A. M. Raigorodskii
Mathematical Physics, Dynamical Systems and Infinite-Dimensional
Analysis – 2021 June 30, 2021 10:30
|
13. |
Выступление A. M. Raigorodskii
General Meeting of the Branch of Mathematical Sciences, RAS, 2020 December 7, 2020 14:00
|
14. |
Случайные подграфы графов Джонсона A. M. Raigorodskii
Knots and Representation Theory November 18, 2019 18:30
|
15. |
Раскраски гиперграфов, занятие 3 A. M. Raigorodskii
July 28, 2019 17:15
|
16. |
Раскраски гиперграфов, занятие 2 A. M. Raigorodskii
July 27, 2019 11:15
|
17. |
Раскраски гиперграфов, занятие 1 A. M. Raigorodskii
July 26, 2019 17:15
|
18. |
Графы, случайные графы и комбинаторная геометрия A. M. Raigorodskii
MIPT Interdepartmental Seminar on Discrete Mathematics September 19, 2018 18:30
|
19. |
Задачи Школы Прикладной Математики и Информатики МФТИ A. M. Raigorodskii
Mathematical Workshop of the School of Applied Mathematics and Computer Science (MIPT) March 23, 2018 19:00
|
20. |
On the chromatic numbers of random graphs A. M. Raigorodskii
А.A.Karatsuba's 80th Birthday Conference in Number Theory and Applications May 27, 2017 12:10
|
21. |
Экстремальные задачи о гиперграфах с разрешенными пересечениями ребер A. M. Raigorodskii, A. V. Bobu, A. E. Kupriyanov
April 11, 2017 19:15
|
22. |
Школа Прикладной Математики и Информатики МФТИ - Перспективы Развития A. M. Raigorodskii, V. V. Strijov, K. V. Vorontsov
Mathematical Workshop of the School of Applied Mathematics and Computer Science (MIPT) March 31, 2017 18:30
|
23. |
О теореме Турана для дистанционных графов A. M. Raigorodskii
Knots and Representation Theory March 7, 2017 18:30
|
24. |
О теореме Турана для дистанционных графов A. M. Raigorodskii
March 7, 2017 18:30
|
25. |
Комбинаторика и графы: от красивых абстракций к практическим приложениям A. M. Raigorodskii
Mathematical Workshop of the School of Applied Mathematics and Computer Science (MIPT) October 28, 2016 18:30
|
26. |
Random Graphs A. M. Raigorodskii
Colloquium of the Faculty of Computer Science September 15, 2015 18:10
|
27. |
Extremal combinatorics and random graphs A. M. Raigorodskii
Colloquium of Steklov Mathematical Institute of Russian Academy of Sciences September 3, 2015 16:00
|
28. |
Раскраски графов и их случайных подграфов. Лекция 3 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2014 July 24, 2014 09:30
|
29. |
Раскраски графов и их случайных подграфов. Лекция 2 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2014 July 23, 2014 15:30
|
30. |
Раскраски графов и их случайных подграфов. Лекция 1 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2014 July 22, 2014 12:45
|
31. |
Трудные задачи в Интернете A. M. Raigorodskii
June 23, 2014 10:45
|
32. |
Вокруг гипотезы Кнезера A. M. Raigorodskii
Knots and Representation Theory November 26, 2013 18:30
|
33. |
Classical problems of combinatorial geometry A. M. Raigorodskii
Discrete and Computational Geometry October 30, 2013 13:00
|
34. |
Модели веб-графов и их приложения A. M. Raigorodskii
Mathematical Seminar October 15, 2013 19:30
|
35. |
On Borsuk’s conjecture A. M. Raigorodskii
MIPT Interdepartmental Seminar on Discrete Mathematics October 24, 2012
|
36. |
Systems of representatives and Vapnik–Chervonekis dimension. Lecture 2 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2012 July 29, 2012 12:45
|
37. |
Модели случайных графов и их применения A. M. Raigorodskii
Mathematical modeling of traffic flows February 25, 2012
|
38. |
Models of Random Web Graphs A. M. Raigorodskii
Principle Seminar of the Department of Probability Theory, Moscow State University December 14, 2011 16:45
|
39. |
Random graphs and Internet A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2011 July 28, 2011 12:45
|
40. |
Extremal problems in combinatorics and the theory of geometric graphs. III A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2010 July 25, 2010 09:30
|
41. |
Extremal problems in combinatorics and the theory of geometric graphs. II A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2010 July 23, 2010 11:15
|
42. |
Extremal problems in combinatorics and the theory of geometric graphs. I A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2010 July 20, 2010 17:00
|
43. |
On partitions of sets on spheres in $R^n$ A. M. Raigorodskii
St. Petersburg Seminar on Representation Theory and Dynamical Systems June 2, 2010 18:00
|
44. |
Алгебраические и топологические методы в комбинаторике. Лекция 4 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2009 July 23, 2009 17:00
|
45. |
Алгебраические и топологические методы в комбинаторике. Лекция 3 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2009 July 22, 2009 11:15
|
46. |
Алгебраические и топологические методы в комбинаторике. Лекция 2 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2009 July 20, 2009 17:00
|
47. |
Алгебраические и топологические методы в комбинаторике. Лекция 1 A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2009 July 19, 2009 15:30
|
48. |
On the Borsuk problem A. M. Raigorodskii
Meetings of the St. Petersburg Mathematical Society October 2, 2007
|
49. |
Covering problems and Vapnik–Chervonenkis dimension in combinatorial geometry and geometry of numbers A. M. Raigorodskii
Summer School "Contemporary Mathematics", 2007 July 26, 2007 11:30
|
50. |
Об одном принципе «альтернирования» A. M. Raigorodskii
Meetings of the Moscow Mathematical Society February 20, 2007
|
51. |
О некоторых задачах комбинаторной геометрии A. M. Raigorodskii
Scientic seminar «Actual problems of geometry and mechanics » named after Prof. V.V. Trofimov April 8, 2005 18:30
|
52. |
Проблемы Борсука и Нелсона–Эрдеша–Хадвигера в комбинаторной геометрии A. M. Raigorodskii
Meetings of the Moscow Mathematical Society March 1, 2005
|
53. |
Chromatic numbers A. M. Raigorodskii
Popular Lectures on Mathematics given at Malyi Mekhmat December 7, 2002
|
|
|
Organisations |
|
|
|
|