Submitted

Journal Publications

Conference Proceedings

Miscellaneous

Submitted

  1. A. Kupavskii, Delta-system method: a survey, submitted
  2. Elizaveta Iarovikova, Andrey Kupavskii, A complete t-intersection theorem for families of spanning trees, submitted
  3. A. Yakunin, A. Sushin, S. Moiseev, A. Kupavskii, Near-optimal edge partitioning via intersecting families, submitted
  4.  Bludov Mikhail, Gribanov Dmitry, Klimenko Maxim, Kupavskii Andrey, Lángi Zsolt, Rogozin Alexander, Voronov Vsevolod, On the Vertices of Delta-modular Polyhedra, submitted
  5. A. Kupavskii, F. Noskov, Linear dependencies, polynomial factors in the Duke--Erdos forbidden sunflower problem, submitted
  6. G. Dakhno, D. Gribanov, N. Kasianov, A. Kats, A. Kupavskii, N. Kuz'min, Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra, submitted
  7. P. Frankl, G. Hurlbert, F. Ihringer, A. Kupavskii, N. Lindzey, K. Meagher, V. Raghu Tej Pantangi, Intersecting Families of Spanning Trees, submitted
  8. P. Frankl, A. Kupavskii, The Hajnal--Rothschild problem, submitted
  9. A. Kupavskii, An almost complete t-intersection theorem for permutations, in preparation
  10. A. Kupavskii, Intersection theorems for uniform subfamilies of hereditary families, submitted
  11. Louis Esperet, Nathaniel Harms, Andrey Kupavskii, Sketching Distances in Monotone Graph Classes, submitted
  12. N. Frankl, A. Kupavskii, On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs, submitted

Journal Publications

Number of papers in selected journals:   Advances in Math.: 1 IMRN:  1,   Proc. AMS:  2,   Proc. LMS:  1,   Journ. LMS:  1,   Bull. LMS:  1,   Forum Math. Sigma:  1,   Combinatorica:  5,   JCTB:  6,   JCTA:  8,   Eur. J. Comb:  15,   CPC:  4,   DCG:  5,   RSA:  1,   Disc. Anal.:  1,   JMLR:  1,   SODA: 1,  Proc. SoCG:  3.

  1. A. Kupavskii, E. Popova, Satisfying sequences for rainbow partite matchings, accepted at Comb. Probab. Comput.
  2. P. Frankl, A. Kupavskii, Intersection problems and a correlation inequality for integer sequences, SIAM J. Disc. Math. 39 (2025), N1, 1274-1279 DOI
  3. A. Kupavskii, Erdős-Ko-Rado type results for partitions via spread approximations, accepted at Eur. J. Comb.
  4. F. Ihringer, A. Kupavskii, The Erdős-Rado Sunflower Problem for Vector Spaces, to appear in Finite Fields and Applications
  5. E. Inozemtsev, A. Kupavskii, Two questions on Kneser colorings, Disc. Math. 349 (2026) N3 DOI
  6. A. Kupavskii, Intersecting families with covering number 3, accepted at J. Comb. Theory Ser. B
  7. Andrey Kupavskii, Arsenii Sagdeev, Dmitrii Zakharov, Cutting Corners, to appear at J. Comb. Theory Ser. B
  8. A. Kupavskii, D. Tsarev, Stability for binary scalar products, accepted at Eur. J. Comb.
  9. A. Kupavskii, Structure of non-trivial intersecting families, to appear in Proc. Amer. Math. Soc. 
  10. A. Kupavskii, F. Noskov, Octopuses in the Boolean cube: families with pairwise small intersections, part II, Discrete Math. 348 (2025)  DOI
  11. P. Frankl, A. Kupavskii, Non-trivial r-wise agreeing families, Eur J. Comb. 126 (2025) DOI
  12. S. Kiselev, A. Kupavskii, O. Verbitsky, M. Zhukovskii, On Isomorphism-Invariant Antistochastic Properties of Random Graphs, SIAM J. Disc. Math. 38 (2024), DOI  
  13. P. Frankl, A. Kupavskii, Maximal degrees in subgraphs of Kneser graphs, Journal of Graph Theory, DOI
  14. S. Kiselev, A. Kupavskii, Trivial colors in colorings of Kneser graphs, Discrete Math, 347 (2024), N4, DOI
  15. A. Kupavskii, D. Zakharov, Spread approximations and forbidden intersections, Advances in Mathematics 445 (2024), DOI
  16. N. Frankl, A. Kupavskii, A. Sagdeev, Max-norm Ramsey Theory, Eur. J. Comb. 118 (2024), DOI
  17. R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, The crossing Tverberg Theorem, Disc. Comput. Geom. (2023), DOI
  18. A. Kupavskii, L. Popova, Tilings of \mathbb Z with multisets of distances, Discrete Math. 347 (2024), N9, DOI
  19. A. Kupavskii, F. Noskov, Octopuses in the Boolean cube: families with pairwise small intersections, part I, J. Comb. Theory. Ser. B 163 (2023),  308-331, DOI
  20. D. Kolupaev, A. Kupavskii, Erdős Matching Conjecture for almost perfect matchings, Discrete Math. 346 (2023), N4, DOI
  21. P. Frankl, A. Kupavskii, Perfect matchings in down-sets, Discrete Math. 346 (2023), N5, DOI
  22. A. Golovanov, A. Kupavskii, A. Sagdeev, On the maximum sizes of odd-distance and right-equidistant sets, European J. Comb. 107 (2023), 103603, DOI
  23. N. Frankl, A. Kupavskii, A. Sagdeev, Solution to a conjecture of Schmidt and Tuller conjecture on one-dimensional packings and coverings, Proceedings of American Mathematical Society, DOI
  24. N. Frankl, A. Kupavskii, A. Sagdeev, Infinite sets can be Ramsey in the Chebyshev metric, Russian Mathematical Surveys 77 (2022), N3, 549–551, DOI
  25. P. Frankl,  A. Kupavskii, S. Kiselev, Best possible bounds on the number of distinct differences in intersecting families, European J. Comb. 107 (2023), 103601, DOI
  26. N. Frankl, A. Kupavskii, Almost Sharp Bounds on the Number of Discrete Chains in the Plane, Combinatorica 42 (2022), N6, 1119-1143, DOI
  27. V. Bulankina, A. Kupavskii, Choice number of Kneser graphs, Discrete Math., 345 (2022), N11, 113097, DOI
  28. P. Frankl, A. Kupavskii, Uniform intersecting families with large covering number, European J. Comb. 113 (2023), 103747, DOI
  29. A. Kupavskii, A. Volostnov, Y. Yarovikov, Minimum number of partial triangulations, European J. Comb. 108 (2023), DOI
  30. C. Groenland, T. Johnston, A. Kupavskii, K. Meeks, A. Scott, J. Tan, Reconstructing the degree sequence of a sparse graph from a partial deck, J. Comb. Theory. Ser. B 157 (2022), 283-293, DOI
  31. N Frankl, S Kiselev, A Kupavskii, B Patkós, VC-saturated set systems, European J. Comb. 104 (2022), 103528, DOI
  32. P. Frankl, A. Kupavskii, Intersection theorems for (-1,0,1) -vectors, European J. Comb., 103830, DOI
  33. A. Kupavskii, Rainbow version of the Erdos Matching Conjecture via Concentration, Combinatorial Theory 3 (2023) N1, DOI
  34. A. Kupavskii, S. Weltge, Binary scalar products, J. Comb. Theory. Ser. B 156 (2022), 18-30, DOI
  35. P. Frankl, A. Kupavskii, S. Kiselev, On the maximum number of distinct intersections in an intersecting family,  Discrete Math. 345 (2022), N4, DOI
  36. P. Frankl, A. Kupavskii,  The Erdős Matching Conjecture and Concentration Inequalities, Journal of Comb. Theory Ser B. 157 (2022), 366-400, DOI
  37. A. Kupavskii, A. Sagdeev, All finite sets are Ramsey in the maximum norm, Forum of Mathematics, Sigma 9 (2021), DOI
  38. S. Kiselev, A. Kupavskii, Sharp bounds for the chromatic number of random Kneser graphs and hypergraphs, J. Comb. Theory Ser. B 157 (2022), 96-122, DOI
  39. A. Kupavskii, A. Polyanskii, I. Tomon, D. Zakharov, The extremal number of surfaces, International Mathematics Research Notices, DOI
  40. P. Frankl, A. Kupavskii, Beyond the Erdős Matching Conjecture, Eur. J. Comb. 95 (2021), DOI
  41. P. Frankl, A. Kupavskii, Diversity, J. Comb. Theory Ser. A 182 (2021), DOI
  42. P. Frankl, A. Kupavskii, Almost intersecting families, Electron. J. Comb 28 (2021), N2, p2.7, DOI
  43. P. Frankl, A. Holmsen, A. Kupavskii, Intersection theorems for triangles, Discrete and Computational Geometry (2021), DOI
  44. N. Frankl, A. Kupavskii, Nearly k-distance sets, Discrete and Computational Geometry 70 (2023), N3, 455-494, DOI
  45. S. Kiselev, A. Kupavskii, Rainbow matchings in k-partite hypergraphs, Bulletin of the London Math. Society 53 (2021), N2, 360-369, DOI
  46. Andrey Kupavskii, The VC-dimension of k-vertex d-polytopes, Combinatorica 40 (2020), N6, 869-874, DOI
  47. P. Frankl, A. Kupavskii, Simple juntas for shifted families, Discrete Analysis 2020:14, 18 pp., DOI
  48. A. B. Kupavskii, A. A. Sagdeev, Ramsey theory in a space with Chebyshev metric, Uspekhi Mat. Nauk 75 (2020), N5 (455), 191–192, DOI
  49. A. Kupavskii, D. Zakharov, The right acute angles problem?, European Journal of Combinatorics 89 (2020), 103144, DOI
  50. P. Frankl, A. Kupavskii, Sharp results concerning disjoint cross-intersecting families, European Journal of Combinatorics 86 (2020), 103089, DOI
  51. N. Frankl, A. Kupavskii, K. Swanepoel, Embedding graphs in Euclidean space, J. Comb. Theory Ser. A 171 (2020), DOI
  52. A. Kupavskii, N. Zhivotovskiy, When are epsilon-nets small?, Journal of Computer and System Sciences 110 (2020), 22-36, DOI
  53. J. Kim, D. Kühn, A. Kupavskii, D. Osthus, Rainbow structures in locally bounded colourings of graphs, Random Structures and Algorithms 56 (2020), 1171-1204, DOI
  54. P. Frankl, A. Kupavskii, Incompatible intersection properties, Combinatorica 39 (2019), N6, 1255-1266, DOI
  55. M. Csikós, A. Kupavskii, N. Mustafa, Optimal bounds on the VC-dimension, Journal of Machine Learning Research 20 (2019), 81.1-81.8, DOI 
  56. A. Kupavskii, Degree versions of theorems on intersecting families via stability, J. Comb. Theory Ser. A 168 (2019), 272-287, DOI
  57. F. Ihringer, A. Kupavskii, Regular intersecting families, Disc. Appl. Math. 270 (2019), 142-152, DOI
  58. P. Frankl, A. Kupavskii, Families of sets with no matching of sizes 3 and 4, European Journal of Combinatorics 75 (2019), 123-135, DOI
  59. P. Frankl, A. Kupavskii, Partition-free families of sets, Proceedings of the London Mathematical Society 119 (2019), N2, 440-468, DOI
  60. P. Frankl, A. Kupavskii, Two problems on matchings in set families - in the footsteps of Erdős and Kleitman, J. Comb. Th. Ser. B 138 (2019),  286-313, DOI
  61. A. Kupavskii, N. Mustafa, K. Swanepoel, Bounding the size of an almost-equidistant set in Euclidean space, Comb. Probab. Comput. 28 (2019), N2, 280-286, DOI
  62. A. Kupavskii, J. Pach, I. Tomon, On the size of k-cross-free families, Combinatorica 39 (2019), N1, 153-164, DOI
  63. A. Kupavskii, E. Welzl, Lower bounds for searching robots, some faulty, Distributed Computing 34 (2021), 229-237, DOI
  64. A. Kupavskii, Random Kneser graphs and hypergraphs, Electronic Journal of Combinatorics (2018) P4.52, DOI
  65. A. Kupavskii, M. Zhukovskii, Short monadic second-order sentences about sparse random graphs, SIAM J. Discrete Math. 32 (2018), N4, 2916–2940, DOI
  66. A. Kupavskii, Diversity of uniform intersecting families, European Journal of Combinatorics 74 (2018), 39-47, DOI
  67. A. Kupavskii, J. Pach, G. Tardos, Tilings with noncongruent triangles, European Journal of Combinatorics 73 (2018), 72-80, DOI
  68. A. Kupavskii, J. Pach, G. Tardos, Controlling Lipschitz functions, Mathematika 64 (2018), N3, 898--910, DOI
  69. A. Kupavskii, J. Pach, G. Tardos, Tilings of the plane with unit area triangles of bounded diameter, Acta Math. Hungarica 155 (2018), N1, 175-183, DOI
  70. P. Frankl, A. Kupavskii,  New inequalities for families without k pairwise disjoint members,  J. Comb. Th. Ser. A  157 (2018), 427-434, DOI
  71. P. Frankl, A. Kupavskii,  Erdős-Ko-Rado theorem for \{0,\pm 1\} -vectors, J. Comb. Theory Ser. A 155 (2018), 157-179, DOI
  72. A. Kupavskii, D. Zakharov, Regular bipartite graphs and intersecting families, J. Comb. Theory Ser. A 155 (2018), 180-189, DOI
  73. P. Frankl, A. Kupavskii, Families of vectors without antipodal pairs, Studia Sci. Math. Hungarica 55 (2018), N2, 231-237, DOI
  74. P. Frankl, A. Kupavskii, Counting intersecting and pairs of cross-intersecting families, Comb. Probab. Comput. 27 (2018), N1, 60-68, DOI
  75. A. Kupavskii, D.A. Shabanov, Colorings of uniform hypergraphs with large girth and applications, Combinatorics, Probability & Computing 27 (2018), N2, 245-273, DOI
  76. P. Frankl, A. Kupavskii,  Families with no s pairwise disjoint sets, Journal of the London Mathematical Society 95 (2017), N3, 875-894, DOI
  77. P. Frankl, A. Kupavskii, Intersection theorems for \{0,\pm 1\} -vectors and s-cross-intersecting families, Moscow Journal of Combinatorics and Number Theory 7 (2017), N2, 91-109, DOI
  78. P. Frankl, A. Kupavskii, A size-sensitive inequality for cross-intersecting families, European Journal of Combinatorics 62 (2017), 263-271, DOI
  79. P. Frankl, A. Kupavskii, Uniform s-cross-intersecting families, Combinatorics, Probability and Computing 26 (2017), N4, 517-524, DOI
  80. A. Kupavskii, J. Pach, From Tarski's plank problem to simultaneous approximation, The American Math. Monthly 124 (2017), N6, 494-505, DOI
  81. A. Kupavskii, A. Polyanskii, Proof of Schur's conjecture in \mathbb R^d, Combinatorica 37 (, N6, 1181-1205, DOI
  82. A. B. Kupavskii, M. E. Zhukovskii, Spectra of short monadic sentences about sparse random graphs, Doklady Math. 95 (2017),  N1, 60-61.
  83. A. Kupavskii, A. Polyanskii, On simplices in diameter graphs in \mathbb R^4, Mathematical Notes 101 (2017), N2, 232-246.
  84. A. Kupavskii, Number of double-normal pairs in space, Discrete and Computational Geometry 56 (2016), N3, 711-726, DOI
  85. A. Kupavskii, On random subgraphs of Kneser and Schrijver graphs, J. Comb Theory Ser. A  141 (2016), 8–15, DOI
  86. V.V. Bulankina, A.B. Kupavskii, A.A. Polyanskiy, On Schur's conjecture in \mathbb R^4, Math. Notes 97, N1 (2015), 21–29.
  87. A. Kupavskii, D.A. Shabanov, Colorings of Partial Steiner Systems and Their Applications, J. Math. Sci. 206 (2015), N6, 511–538.
  88. A. Kupavskii, Diameter graphs in \mathbb R^4, Discrete and Computational Geometry 51, N4 (2014), 842–858, DOI
  89. V.V. Bulankina, A.B. Kupavskii, A.A. Polyanskiy, Note on Schur's conjecture in \mathbb R^4, Doklady Math. 89, N1 (2014), 88–91.
  90. N. Alon, A. Kupavskii, Two notions of unit distance graphs, Journal of Combinatorial Theory, Series A 125 (2014), 1–17, DOI
  91. A. Kupavskii, Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers, Izvestiya: Mathematics 78, N1 (2014), 59–89.
  92. A. Kupavskii, M. Titova, Distance Ramsey numbers,  Doklady Math. 87, N2 (2013), 171-174.
  93. A. Kupavskii, A. Raigorodskii, M. Titova, New bounds for distance Ramsey numbers, Discrete Mathematics 313 (2013), 2566–2574, DOI
  94. A.B. Kupavskii, L. Ostroumova, P. Tetali, D. Shabanov, The distribution of second degrees in the Buckley-Osthus random graph model,  Internet Mathematics 9, N4 (2013) 297–335, DOI
  95. A.B. Kupavskii, A.M.Raigorodskii, Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, Sbornik: Mathematics 204, N10 (2013) 1435–1479.
  96. A.B. Kupavskii, D.A. Shabanov, Colorings of partial Steiner systems and their applications, Fundam. Prikl. Mat. 18, N3 (2013),  77–115.
  97. D. Il'inskiy, A. Kupavskii, A. Raigorodskii, A. Skopenkov, Discrete analysis for mathematicians and computer scientists, Matematicheskoe Prosveshenie 3, N 17 (2013), 162–181 (In Russian).
  98. A.B. Kupavskii, A.M. Raigorodskii, M. Titova, On densest sets without distance one in small-dimensional spaces, Proceedings of Moscow Institute of Physics and Technology  4, N1–13 (2012), 111–121 (in Russian).
  99. A.B. Kupavskii, E.I. Ponomarenko, A.M. Raigorodskii, On some analogues of Borsuk problem in \mathbb Q^d, Proceedings of Moscow Institute of Physics and Technology 4, N1–13 (2012), 81–90 (in Russian).
  100. A.B. Kupavskii, A.M. Raigorodskii, On distance graphs with large chromatic numbers and small clique numbers,  Doklady Math. 85 (2012), N3, 394–398.
  101. A.B. Kupavskii, D.A. Shabanov, Colorings of uniform hypergraphs with large girth, Doklady Math. 85 (2012), N2, 247-250.
  102. A.B. Kupavskii, Distance graphs with large chromatic number and arbitrary girth, Moscow J. Comb. Number Theory 2 (2012), N2, 52–62.
  103. A.B. Kupavskii, A.M. Raigorodskii, Counterexamples to Borsuk's conjecture on spheres of small radii, Moscow J. Comb. Number Theory 2 (2012), N4 27–48.
  104. A. Kupavskiy, On the chromatic number of \mathbb R^n with an arbitrary norm, Discrete Mathematics 311 (2011), 437–440, DOI
  105. A. Kupavskii, On the coloring of spheres embedded in \mathbb R^n, Sbornik: Mathematics 202 (2011), N6, 859-886.
  106. A. Kupavskii, The chromatic number of the space  \mathbb R^n with the set of forbidden distances, Doklady Math. 82 (2010), N3, 963-966.
  107. A. Kupavskii, A.M. Raigorodskii, Partition of 3-dimensional sets into 5 parts of smaller diameter, Math. Notes 87 (2010), N2, 218-229.
  108. A. Kupavskii, Lifting lower bounds of the chromatic number of \mathbb R^n in higher dimension, Doklady Math. 80, N3 (2009), 833–836.
  109. A. Kupavskiy, A.M. Raigorodskii, About the chromatic number of \mathbb R^9, J. Math. Sci. 163, N6 (2008), 720–731.

Refereed Conferences Publications

  1. S. Bhore, B. Keszegh, A.Kupavskii, Hung Le, A. Louvet, D. Pálvölgyi, C. D. Tóth, Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers, SODA'2025 DOI
  2. S. Kiselev, A. Kupavskii, O. Verbitsky, M. Zhukovskii, On anti-stochastic properties of unlabeled graphs, Proceedings of WG'2022, DOI
  3. L. Esperet, A. Kupavskii, J. Noel, Sketching Distances in Monotone Graph Classes, Proceedings of Random'2022, DOI
  4. N. Frankl, A. Kupavskii, Almost Sharp Bounds on the Number of Discrete Chains in the Plane, Symposium on Computational Geometry (2020), 48:1-48:15, DOI
  5. P. Frankl, A. Kupavskii, Some results around the Erdős Matching Conjecture, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 695-699.
  6. S. Kiselev, A. Kupavskii, Sharp bounds for the chromatic number of random Kneser graphs, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 861'865.
  7. N. Frankl, A. Kupavskii, Nearly k-distance sets, Acta Mathematica Universitatis Comenianae, 88 (2019), N3, 689-693.
  8. R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, The crossing Tverberg Theorem, Proceedings of SoCG'19, 38:1-38:13, DOI
  9. A. Kupavskii, E. Welzl, Lower bounds for searching robots, some faulty, Proceedings of PODC'18, DOI
  10. N. Frankl, A. Kupavskii, K. Swanepoel, Embedding graphs in Euclidean space, Electronic Notes in Discrete Mathematics 61 (2017), 475-481. Proceedings of  EuroComb'17
  11. A. Kupavskii, P. Frankl, Families with no matchings of size s, Electronic Notes in Discrete Mathematics 61 (2017), 483-489. Proceedings of EuroComb'17
  12. A. Kupavskii, N. Mustafa, J. Pach, Near-Optimal Lower Bounds for \epsilon-nets for Halfspaces and Low Complexity Set Systems, A Journey Through Discrete Mathematics. Springer, Cham (2017), 527-541.
  13. P. Frankl, A. B. Kupavskii, A short proof for an extension of the Erdős-Ko-Rado Theorem, in Proceedings of Connections in Discrete Mathematics conference.
  14. A. Kupavskii, N. Mustafa, J. Pach, Lower bounds for the size of \epsilon-nets, Proceedings of SoCG'2016, DOI
  15. A. Kupavskii, J. Pach, Simultaneous approximation of polynomials, Proceedings of JCDCG^2 (2015), DOI
  16. N. Alon, A. Kupavskii, Two notions of unit distance graphs, Proceedings of EuroComb'13.
  17. A. Kupavskii, L. Ostroumova, A. Umnov, S. Usachev, P. Serdyukov, G. Gusev, A. Kustarev, Prediction of retweet cascade size over time, Proceedings of the 21st ACM international conference on Information and knowledge management (2012), ACM, DOI
  18. A. Kupavskii, A. Umnov, G. Gusev, P. Serdyukov, Predicting the Audience Size of a Tweet, ICWSM'13.
  19. A.B. Kupavskii, A.M. Raigorodskii, On the chromatic number of small-dimensional Euclidean spaces, Electronic Notes in Discrete Mathematics, EuroComb'09.

Books

  1. A.A. Glibichuk, A.A. Dainyak, D.G. Il'insliy, A.B. Kupavskii, A.M. Raigorodskii, A.B. Skopenkov, A.A. Chernov, Elements of discrete mathematics in problems, MCCME, 2016 (in Russian).

PhD thesis

  • A. Kupavskii, Packing and colouring spheres in high-dimensional spaces, Moscow State University, 26.04.2013.

Habilitation