On the chromatic numbers of small-dimensional Euclidean spaces. - Andrey B. Kupavskii; Andrei M. Raigorodskii (Electron. Notes Discret. Math., 2009)

Counterexamples to Borsuk's conjecture on spheres of small radii. - Andrei Kupavskii; Andrei M. Raigorodskii (CoRR, 2010)

On r-colorability of random hypergraphs. - Andrei Kupavskii; Dmitry A. Shabanov (CoRR, 2011)

Prediction of retweet cascade size over time. - Andrey Kupavskii; Liudmila Ostroumova; Alexey Umnov; Svyatoslav Usachev; Pavel Serdyukov; Gleb Gusev; Andrey Kustarev (CIKM, 2012)

Predicting the Audience Size of a Tweet. - Andrey Kupavskii; Alexey Umnov; Gleb Gusev; Pavel Serdyukov (ICWSM, 2013)

Distance graphs with large chromatic number and arbitrary girth. - Andrey Kupavskii (CoRR, 2013)

New bounds for the distance Ramsey number. - Andrey B. Kupavskii; Andrei M. Raigorodskii; Maria V. Titova (Discret. Math., 2013)

The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model. - Andrey Kupavskii; Liudmila Ostroumova; Dmitry A. Shabanov; Prasad Tetali (Internet Math., 2013)

Proof of Schur's conjecture in ℝd. - Andrey B. Kupavskii; Alexandr Polyanskii (CoRR, 2014)

Number of double-normal pairs in space. - Andrey Kupavskii (CoRR, 2014)

Diameter Graphs in ℝ4. - Andrey Kupavskii (Discret. Comput. Geom., 2014)

Two notions of unit distance graphs. - Noga Alon; Andrey Kupavskii (J. Comb. Theory A, 2014)

Simultaneous Approximation of Polynomials. - Andrei Kupavskii; János Pach (JCDCGG, 2015)

New Lower Bounds for epsilon-Nets. - Andrey Kupavskii; Nabil H. Mustafa; János Pach (SoCG, 2016)

Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families. - Peter Frankl; Andrey Kupavskii (CoRR, 2016)

Two problems of P. Erdős on matchings in set families. - Peter Frankl; Andrey Kupavskii (CoRR, 2016)

The number of double-normals in space. - Andrey Kupavskii (Discret. Comput. Geom., 2016)

On random subgraphs of Kneser and Schrijver graphs. - Andrey Kupavskii (J. Comb. Theory A, 2016)

Proof of Schur's Conjecture in ℝ D. - Andrey B. Kupavskii; Alexandr Polyanskii (Comb., 2017)

Controlling Lipschitz functions. - Andrey Kupavskii; János Pach; Gábor Tardos (CoRR, 2017)

Families of vectors without antipodal pairs. - Peter Frankl; Andrey Kupavskii (CoRR, 2017)

Partition-free families of sets. - Peter Frankl; Andrey Kupavskii (CoRR, 2017)

Structure and properties of large intersecting families. - Andrey Kupavskii (CoRR, 2017)

Tilings of the plane with unit area triangles of bounded diameter. - Andrey Kupavskii; János Pach; Gábor Tardos (CoRR, 2017)

Uniform s-Cross-Intersecting Families. - Peter Frankl; Andrey Kupavskii (Comb. Probab. Comput., 2017)

A size-sensitive inequality for cross-intersecting families. - Peter Frankl; Andrey Kupavskii (Eur. J. Comb., 2017)

Families with no matchings of size s. - Peter Frankl; Andrey Kupavskii (Electron. Notes Discret. Math., 2017)

Families with no s pairwise disjoint sets. - Peter Frankl; Andrey Kupavskii (J. Lond. Math. Soc., 2017)

From Tarski's Plank Problem to Simultaneous Approximation. - Andrey Kupavskii; János Pach (Am. Math. Mon., 2017)

Random Kneser Graphs and Hypergraphs. - Andrey Kupavskii (Electron. J. Comb., 2018)

New inequalities for families without k pairwise disjoint members. - Peter Frankl; Andrey Kupavskii (CoRR, 2018)

Optimal Bounds on the VC-dimension. - Mónika Csikós; Andrey Kupavskii; Nabil H. Mustafa (CoRR, 2018)

Counting Intersecting and Pairs of Cross-Intersecting Families. - Peter Frankl; Andrey Kupavskii (Comb. Probab. Comput., 2018)

Colourings of Uniform Hypergraphs with Large Girth and Applications. - Andrey Kupavskii; Dmitry A. Shabanov (Comb. Probab. Comput., 2018)

Diversity of uniform intersecting families. - Andrey Kupavskii (Eur. J. Comb., 2018)

Tilings with noncongruent triangles. - Andrey Kupavskii; János Pach; Gábor Tardos (Eur. J. Comb., 2018)

Erdős-Ko-Rado theorem for {0, ±1}-vectors. - Peter Frankl; Andrey Kupavskii (J. Comb. Theory A, 2018)

New inequalities for families without k pairwise disjoint members. - Peter Frankl; Andrey Kupavskii (J. Comb. Theory A, 2018)

Regular bipartite graphs and intersecting families. - Andrey Kupavskii; Dmitriy Zakharov (J. Comb. Theory A, 2018)

Short Monadic Second Order Sentences about Sparse Random Graphs. - Andrey Kupavskii; Maksim Zhukovskii (SIAM J. Discret. Math., 2018)

Incompatible Intersection Properties. - Peter Frankl; Andrey Kupavskii (Comb., 2019)

On the Size of K-Cross-Free Families. - Andrey Kupavskii; János Pach; István Tomon (Comb., 2019)

Simple juntas for shifted families. - Peter Frankl; Andrey Kupavskii (CoRR, 2019)

Bounding the Size of an Almost-Equidistant Set in Euclidean Space. - Andrey Kupavskii; Nabil H. Mustafa; Konrad J. Swanepoel (Comb. Probab. Comput., 2019)

Regular intersecting families. - Ferdinand Ihringer; Andrey Kupavskii (Discret. Appl. Math., 2019)

Families of sets with no matchings of sizes 3 and 4. - Peter Frankl; Andrey Kupavskii (Eur. J. Comb., 2019)

Two problems on matchings in set families - In the footsteps of Erdős and Kleitman. - Peter Frankl; Andrey Kupavskii (J. Comb. Theory B, 2019)

Degree versions of theorems on intersecting families via stability. - Andrey Kupavskii (J. Comb. Theory A, 2019)

Tight Lower Bounds on the VC-dimension of Geometric Set Systems. - Mónika Csikós; Nabil H. Mustafa; Andrey Kupavskii (J. Mach. Learn. Res., 2019)

The VC-Dimension of K-Vertex D-Polytopes. - Andrey Kupavskii (Comb., 2020)

Rainbow matchings in k-partite hypergraphs. - Sergei Kiselev; Andrey Kupavskii (CoRR, 2020)

Maximal degrees in subgraphs of Kneser graphs. - Peter Frankl; Andrey Kupavskii (CoRR, 2020)

Intersection theorems for (-1, 0, 1)-vectors. - Peter Frankl; Andrey Kupavskii (CoRR, 2020)

Sharp results concerning disjoint cross-intersecting families. - Peter Frankl; Andrey Kupavskii (Eur. J. Comb., 2020)

The right acute angles problem? - Andrey Kupavskii; Dmitriy Zakharov (Eur. J. Comb., 2020)

When are epsilon-nets small? - Andrey Kupavskii; Nikita Zhivotovskiy (J. Comput. Syst. Sci., 2020)

Embedding graphs in Euclidean space. - Nóra Frankl; Andrey Kupavskii; Konrad J. Swanepoel (J. Comb. Theory A, 2020)

Rainbow structures in locally bounded colorings of graphs. - Jaehoon Kim; Daniela Kühn; Andrey Kupavskii; Deryk Osthus (Random Struct. Algorithms, 2020)

Almost Intersecting Families. - Peter Frankl; Andrey Kupavskii (Electron. J. Comb., 2021)

On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs. - Nóra Frankl; Andrey Kupavskii (CoRR, 2021)

Lower bounds for searching robots, some faulty. - Andrey Kupavskii; Emo Welzl (Distributed Comput., 2021)

Beyond the Erdős Matching Conjecture. - Peter Frankl; Andrey Kupavskii (Eur. J. Comb., 2021)

Diversity. - Peter Frankl; Andrey Kupavskii (J. Comb. Theory A, 2021)

Sketching Distances in Monotone Graph Classes. - Louis Esperet; Nathaniel Harms; Andrey Kupavskii (APPROX/RANDOM, 2022)

On Anti-stochastic Properties of Unlabeled Graphs. - Sergei Kiselev; Andrey Kupavskii; Oleg Verbitsky 001; Maksim Zhukovskii (WG, 2022)

Intersection Theorems for Triangles. - Peter Frankl; Andreas F. Holmsen; Andrey Kupavskii (Discret. Comput. Geom., 2022)

Choice number of Kneser graphs. - Vera Bulankina; Andrey Kupavskii (Discret. Math., 2022)

On the maximum number of distinct intersections in an intersecting family. - Peter Frankl; Sergei Kiselev; Andrey Kupavskii (Discret. Math., 2022)

VC-saturated set systems. - Nóra Frankl; Sergei Kiselev; Andrey Kupavskii; Balázs Patkós (Eur. J. Comb., 2022)

The Erdős Matching Conjecture and concentration inequalities. - Peter Frankl; Andrey Kupavskii (J. Comb. Theory B, 2022)

Reconstructing the degree sequence of a sparse graph from a partial deck. - Carla Groenland; Tom Johnston; Andrey Kupavskii; Kitty Meeks; Alex D. Scott; Jane Tan (J. Comb. Theory B, 2022)

Sharp bounds for the chromatic number of random Kneser graphs. - Sergei Kiselev; Andrey Kupavskii (J. Comb. Theory B, 2022)

Binary scalar products. - Andrey Kupavskii; Stefan Weltge (J. Comb. Theory B, 2022)

Almost Sharp Bounds on the Number of Discrete Chains in the Plane. - Nóra Frankl; Andrey Kupavskii (Comb., 2022)

Rainbow version of the Erdős Matching Conjecture via concentration. - Andrey Kupavskii (Comb. Theory, 2023)

Erd H os-Ko-Rado type results for partitions via spread approximations. - Andrey Kupavskii (CoRR, 2023)

Choosing optimal parameters for a distributed multi-constrained QoS routing. - Sergey Komech; Andrey Kupavskii; Alexei Vezolainen (CoRR, 2023)

Best possible bounds on the number of distinct differences in intersecting families. - Peter Frankl; Sergei Kiselev; Andrey Kupavskii (Eur. J. Comb., 2023)

Odd-distance and right-equidistant sets in the maximum and Manhattan metrics. - Alexander Golovanov; Andrey Kupavskii; Arsenii Sagdeev (Eur. J. Comb., 2023)

Minimum number of partial triangulations. - Andrey Kupavskii; Aleksei Volostnov; Yury Yarovikov (Eur. J. Comb., 2023)

Erdős matching conjecture for almost perfect matchings. - Dmitriy Kolupaev; Andrey Kupavskii (Discret. Math., 2023)

Perfect matchings in down-sets. - Peter Frankl; Andrey Kupavskii (Discret. Math., 2023)

Nearly k-Distance Sets. - Nóra Frankl; Andrey Kupavskii (Discret. Comput. Geom., 2023)

Uniform intersecting families with large covering number. - Peter Frankl; Andrey Kupavskii (Eur. J. Comb., 2023)

Octopuses in the Boolean cube: Families with pairwise small intersections, part I. - Andrey Kupavskii; Fedor Noskov (J. Comb. Theory B, 2023)

Robust Algebraic Connectivity. - Ilya A. Kuruzov; Alexander Rogozin; S. A. Chezhegov; Andrey B. Kupavskii (Program. Comput. Softw., 2023)

Stability for binary scalar products. - Andrey Kupavskii; Dmitry V. Tsarev (CoRR, 2024)

Intersecting families with covering number 3. - Andrey Kupavskii (CoRR, 2024)

An almost complete t-intersection theorem for permutations. - Andrey Kupavskii (CoRR, 2024)

Two questions on Kneser colorings. - Eduard Inozemtsev; Andrey Kupavskii (CoRR, 2024)

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra. - Grigorii Dakhno; Dmitry Gribanov; Nikita Kasianov; Anastasiia Kats; Andrey Kupavskii; Nikita Kuzmin (CoRR, 2024)

Structure of non-trivial intersecting families. - Andrey Kupavskii (CoRR, 2024)

Tilings of Z with multisets of distances. - Andrey Kupavskii; Elizaveta Popova (Discret. Math., 2024)

Max-norm Ramsey theory. - Nóra Frankl; Andrey Kupavskii; Arsenii Sagdeev (Eur. J. Comb., 2024)

On Isomorphism-Invariant Antistochastic Properties of Random Graphs. - Sergei Kiselev; Andrey Kupavskii; Oleg Verbitsky 001; Maksim Zhukovskii (SIAM J. Discret. Math., 2024)

Intersection theorems for (-1,0,1)-vectors. - Peter Frankl; Andrey Kupavskii (Eur. J. Comb., 2024)

Trivial colors in colorings of Kneser graphs. - Sergei Kiselev; Andrey Kupavskii (Discret. Math., 2024)

The Crossing Tverberg Theorem. - Radoslav Fulek; Bernd Gärtner; Andrey Kupavskii; Pavel Valtr 001; Uli Wagner 001 (Discret. Comput. Geom., 2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. - Sujoy Bhore; Balázs Keszegh; Andrey Kupavskii; Hung Le 001; Alexandre Louvet; Dömötör Pálvölgyi; Csaba D. Tóth (SODA, 2025)

Octopuses in the Boolean cube: Families with pairwise small intersections, part II. - Andrey Kupavskii; Fedor Noskov (Discret. Math., 2025)

Non-trivial r-wise agreeing families. - Peter Frankl; Andrey Kupavskii (Eur. J. Comb., 2025)

Intersection Problems and a Correlation Inequality for Integer Sequences. - Peter Frankl; Andrey Kupavskii (SIAM J. Discret. Math., 2025)

Satisfying sequences for rainbow partite matchings. - Andrey Kupavskii; Elizaveta Popova (CoRR, 2025)

The Hajnal-Rothschild problem. - Peter Frankl; Andrey Kupavskii (CoRR, 2025)

Near optimal edge partitioning via intersecting families. - Alexander Yakunin; Stanislav Moiseev; Andrey Kupavskii (CoRR, 2025)

A complete t-intersection theorem for families of spanning trees. - Elizaveta Iarovikova; Andrey Kupavskii (CoRR, 2025)