Andrey Kupavskii version 1


Andrey Kupavskii

Research interests

Extremal Combinatorics, Discrete and Computational Geometry, Probabilistic Methods, Analysis of Boolean Functions, selected topics in Computer Science

Webpages and profiles on other sites

Short Biography

I was born on 17.11.1989 in Noginsk, Russia. I graduated with honours from Noginsk Gymnasium in 2005.  I received a Master's degree with honours in mathematics from Moscow State University in 2010. In 2013 I got my PhD in mathematics from the Number Theory Department of Moscow State University under the supervision of prof. A.M. Raigorodskii and prof N.G. Moschevitin.

Dec 2018 - present: University of Oxford, UK: Advanced Postdoc.Mobility fellow of Swiss National Science Foundation (host: Prof. Peter Keevash).

Nov 2017 - Nov 2018, University of Birmingham, UK: postdoc in the Combinatorics and Probability group (head: Prof. Daniela Kühn and Prof. Deryk Osthus).

Oct 2016 - Oct 2017, EPFL, Switzerland: research fellow (postdoc) in the DCG (Discrete and Computational Geometry) group (head: Prof. János Pach).

May 2016 - present, MIPT, Russia: senior research fellow at the Laboratory of Advanced Combinatorics and Networks Applications (head: Prof. Andrei Raigorodskii).

Feb 2016 - Sept 2016, G-SCOP, CNRS, France: postdoc in the Combinatorial Optimization group (head: Dr András Sebö).

Sept 2013 - Jan 2016, EPFL, Switzerland: postdoc in the DCG (Discrete and Computational Geometry) group (head: Prof. János Pach).

Sept 2011 - May 2016, MIPT, Russia: junior research fellow in the Discrete Mathematics Department (head: Prof. Andrei Raigorodskii).

Jun 2011 - Aug 2013, Yandex, Russia: research fellow in the Yandex theory group (head: Dr Pavel Serdyukov)



  1. P. Frankl, A. Kupavskii, Beyond the Erdős Matching Conjecture, submitted
  2. P. Frankl, A. Kupavskii, Simple juntas for shifted families, submitted
  3. P. Frankl, A. Kupavskii, Diversity, submitted
  4. P. Frankl, A. Kupavskii, Incompatible intersection properties, submitted
  5. P. Frankl, A. Kupavskii,  The Erdős Matching Conjecture and Concentration Inequalities, submitted
  6. J. Kim, D. Kühn, A. Kupavskii, D. Osthus, Rainbow structures in locally bounded colourings of graphs, submitted
  7. N. Frankl, A. Kupavskii, A. Polyanskii, Simplices in diameter and unit distance graphs, in preparation
  8. S. Kiselev, A. Kupavskii, Sharp bounds for the chromatic number of random Kneser graphs and hypergraphs, submitted
  9. A. Kupavskii, N. Zhivotovskiy, When are epsilon-nets small?, submitted
  10. A. Kupavskii, Structure and properties of large intersecting families, submitted
  11. A. Kupavskii, Degree versions of theorems on intersecting families via stability, submitted
  12. F. Ihringer, A. Kupavskii, Regular intersecting families, submitted
  13. M. Csikós, A. Kupavskii, N. Mustafa, Optimal bounds on the VC-dimension, submitted
  14. N. Frankl, A. Kupavskii, K. Swanepoel, Unit distance representations, submitted

Journal Publications

  1. A. Kupavskii, Random Kneser graphs and hypergraphs, Electronic Journal of Combinatorics (2018) P4.52
  2. P. Frankl, A. Kupavskii, Families of sets with no matching of sizes 3 and 4, European Journal of Combinatorics 75 (2019), 123-135.
  3. P. Frankl, A. Kupavskii, Partition-free families of sets, Proceedings of the London Mathematical Society (2019), DOI: 10.1112/plms.12236
  4. P. Frankl, A. Kupavskii, Two problems on matchings in set families - in the footsteps of Erdős and Kleitman, J. Comb. Th. Ser. B (2019)
  5. A. Kupavskii, M. Zhukovskii, Short monadic second-order sentences about sparse random graphs, SIAM J. Discrete Math. 32 (2018), N4, 2916–2940
  6. A. Kupavskii, N. Mustafa, K. Swanepoel, Bounding the size of an almost-equidistant set in Euclidean space, to appear in Comb. Probab. Comput.
  7. A. Kupavskii, Diversity of uniform intersecting families, European Journal of Combinatorics 74 (2018), 39-47.
  8. A. Kupavskii, J. Pach, G. Tardos, Tilings with noncongruent triangles, European Journal of Combinatorics 73 (2018), 72-80.
  9. A. Kupavskii, J. Pach, G. Tardos, Controlling Lipschitz functions, Mathematika 64 (2018), N3, 898--910.
  10. 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
  11. P. Frankl, A. Kupavskii,  New inequalities for families without kk pairwise disjoint members,  J. Comb. Th. Ser. A  157 (2018), 427-434.
  12. P. Frankl, A. Kupavskii,  Erdős-Ko-Rado theorem for {0,±1}{0,±1}-vectors, J. Comb. Theory Ser. A 155 (2018), 157-179.
  13. A. Kupavskii, D. Zakharov, Regular bipartite graphs and intersecting families, J. Comb. Theory Ser. A 155 (2018), 180-189.
  14. A. Kupavskii, J. Pach, I. Tomon, On the size of kk-cross-free families, Combinatorica (2018), DOI: 10.1007/s00493-017-3792-8
  15. P. Frankl, A. Kupavskii, Families of vectors without antipodal pairs, Studia Sci. Math. Hungarica 55 (2018), N2, 231-237.
  16. P. Frankl, A. Kupavskii, Counting intersecting and pairs of cross-intersecting families, Comb. Probab. Comput. 27 (2018), N1, 60-68.
  17. P. Frankl, A. Kupavskii,  Families with no s pairwise disjoint sets, Journal of the London Mathematical Society 95 (2017), N3, 875-894.
  18. P. Frankl, A. Kupavskii, Intersection theorems for {0,±1}{0,±1}-vectors and ss-cross-intersecting families, Moscow Journal of Combinatorics and Number Theory 7 (2017), N2, 91-109.
  19. P. Frankl, A. Kupavskii, A size-sensitive inequality for cross-intersecting families, European Journal of Combinatorics 62 (2017), 263-271
  20. P. Frankl, A. Kupavskii,  Uniform 𝑠-cross-intersecting families, Combinatorics, Probability and Computing 26 (2017), N4, 517-524.
  21. A. Kupavskii, J. Pach, From Tarski's plank problem to simultaneous approximation, The American Math. Monthly 124 (2017), N6, 494-505.
  22. A. Kupavskii, A. Polyanskii, Proof of Schur's conjecture in RdRd, Combinatorica 37 (, N6, 1181-1205.
  23. A. B. Kupavskii, M. E. Zhukovskii, Spectra of short monadic sentences about sparse random graphs, Doklady Math. 95 (2017),  N1, 60-61.
  24. A. Kupavskii, A. Polyanskii, On simplices in diameter graphs in R4R4, Mathematical Notes 101 (2017), N2, 232-246.
  25. A. Kupavskii, D.A. Shabanov, Colorings of uniform hypergraphs with large girth and applications, Combinatorics, Probability & Computing 27 (2018), N2, 245-273.
  26. A. Kupavskii, Number of double-normal pairs in space, Discrete and Computational Geometry 56 (2016), N3, 711-726.
  27. A. Kupavskii, On random subgraphs of Kneser and Schrijver graphs, J. Comb Theory Ser. A  141 (2016), 8–15.
  28. V.V. Bulankina, A.B. Kupavskii, A.A. Polyanskiy, On Schur's conjecture in R4R4, Math. Notes 97, N1 (2015), 21–29.
  29. A. Kupavskii, D.A. Shabanov, Colorings of Partial Steiner Systems and Their Applications, J. Math. Sci. 206 (2015), N6, 511–538.
  30. A. Kupavskii, Diameter graphs in R4R4, Discrete and Computational Geometry 51, N4 (2014), 842–858.
  31. V.V. Bulankina, A.B. Kupavskii, A.A. Polyanskiy, Note on Schur's conjecture in R4R4, Doklady Math. 89, N1 (2014), 88–91.
  32. N. Alon, A. Kupavskii, Two notions of unit distance graphs, Journal of Combinatorial Theory, Series A 125 (2014), 1–17.
  33. A. Kupavskii, Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers, Izvestiya: Mathematics 78, N1 (2014), 59–89.
  34. A. Kupavskii, M. Titova, Distance Ramsey numbers,  Doklady Math. 87, N2 (2013), 171-174.
  35. A. Kupavskii, A. Raigorodskii, M. Titova, New bounds for distance Ramsey numbers, Discrete Mathematics 313 (2013), 2566–2574.
  36. 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
  37. 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.
  38. A.B. Kupavskii, D.A. Shabanov, Colorings of partial Steiner systems and their applications, Fundam. Prikl. Mat. 18, N3 (2013),  77–115.
  39. 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).
  40. 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).
  41. A.B. Kupavskii, E.I. Ponomarenko, A.M. Raigorodskii, On some analogues of Borsuk problem in QdQd, Proceedings of Moscow Institute of Physics and Technology 4, N1–13 (2012), 81–90 (in Russian).
  42. A.B. Kupavskii, A.M. Raigorodskii, On distance graphs with large chromatic numbers and small clique numbers,  Doklady Math. 85 (2012), N3, 394–398.
  43. A.B. Kupavskii, D.A. Shabanov, Colorings of uniform hypergraphs with large girth, Doklady Math. 85 (2012), N2, 247-250.
  44. A.B. Kupavskii, Distance graphs with large chromatic number and arbitrary girth, Moscow J. Comb. Number Theory 2 (2012), N2, 52–62.
  45. 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.
  46. A. Kupavskiy, On the chromatic number of RnRn with an arbitrary norm, Discrete Mathematics 311 (2011), 437–440.
  47. A. Kupavskii, On the coloring of spheres embedded in RnRn, Sbornik: Mathematics 202 (2011), N6, 859-886.
  48. A. Kupavskii, The chromatic number of the space  RnRn with the set of forbidden distances, Doklady Math. 82 (2010), N3, 963-966.
  49. A. Kupavskii, A.M. Raigorodskii, Partition of 3-dimensional sets into 5 parts of smaller diameter, Math. Notes 87 (2010), N2, 218-229.
  50. A. Kupavskii, Lifting lower bounds of the chromatic number of RnRn in higher dimension, Doklady Math. 80, N3 (2009), 833–836.
  51. A. Kupavskiy, A.M. Raigorodskii, About the chromatic number of R9R9, J. Math. Sci. 163, N6 (2008), 720–731.

Refereed Conferences Publications

  1. R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, The crossing Tverberg Theorem, Proceedings of SoCG'19
  2. A. Kupavskii, E. Welzl, Lower bounds for searching robots, some faulty, Proceedings of PODC'18
  3. N. Frankl, A. Kupavskii, K. Swanepoel, Embedding graphs in Euclidean space, Electronic Notes in Discrete Mathematics 61 (2017), 475-481. Proceedings of  EuroComb'17
  4. A. Kupavskii, P. Frankl, Families with no matchings of size ss, Electronic Notes in Discrete Mathematics 61 (2017), 483-489. Proceedings of EuroComb'17
  5. A. Kupavskii, N. Mustafa, J. Pach, Near-Optimal Lower Bounds for ϵϵ-nets for Halfspaces and Low Complexity Set Systems, A Journey Through Discrete Mathematics. Springer, Cham (2017), 527-541.
  6. 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.
  7. A. Kupavskii, N. Mustafa, J. Pach, Lower bounds for the size of ϵϵ-nets, Proceedings of SoCG'2016.
  8. A. Kupavskii, J. Pach, Simultaneous approximation of polynomials, Proceedings of JCDCG^2 (2015).
  9. N. Alon, A. Kupavskii, Two notions of unit distance graphs, Proceedings of EuroComb'13.
  10. 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.
  11. A. Kupavskii, A. Umnov, G. Gusev, P. Serdyukov, Predicting the Audience Size of a Tweet, ICWSM'13.
  12. A.B. Kupavskii, A.M. Raigorodskii, On the chromatic number of small-dimensional Euclidean spaces, Electronic Notes in Discrete Mathematics, EuroComb'09.


  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

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


kupavskii{at}, Andrey.Kupavskii{at}