Andrey Kupavskii

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 119

Top Venues

CoRR

Eur. J. Comb.

J. Comb. Theory, Ser. A

Discret. Math.

Publications

Sergei Kiselev, Andrey Kupavskii
Trivial colors in colorings of Kneser graphs. Discret. Math. 347 (4) (2024)
Andrey Kupavskii, Dmitry V. Tsarev
Stability for binary scalar products. CoRR (2024)
Eduard Inozemtsev, Andrey Kupavskii
Two questions on Kneser colorings. CoRR (2024)
Andrey Kupavskii, Elizaveta Popova
Tilings of Z with multisets of distances. Discret. Math. 347 (9) (2024)
Andrey Kupavskii
Intersecting families with covering number 3. CoRR (2024)
Peter Frankl, Andrey Kupavskii
Intersection theorems for (-1,0,1)-vectors. Eur. J. Comb. 117 (2024)
Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev
Max-norm Ramsey theory. Eur. J. Comb. 118 (2024)
Andrey Kupavskii
An almost complete t-intersection theorem for permutations. CoRR (2024)
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR (2024)
Andrey Kupavskii
Erd\H os-Ko-Rado type results for partitions via spread approximations. CoRR (2023)
Alexander Golovanov, Andrey Kupavskii, Arsenii Sagdeev
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics. Eur. J. Comb. 107 (2023)
Peter Frankl, Andrey Kupavskii
Perfect matchings in down-sets. Discret. Math. 346 (5) (2023)
Peter Frankl, Andrey Kupavskii
Uniform intersecting families with large covering number. Eur. J. Comb. 113 (2023)
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Comb. 107 (2023)
Andrey Kupavskii, Aleksei Volostnov, Yury Yarovikov
Minimum number of partial triangulations. Eur. J. Comb. 108 (2023)
Nóra Frankl, Andrey Kupavskii
Nearly k-Distance Sets. Discret. Comput. Geom. 70 (3) (2023)
Dmitriy Kolupaev, Andrey Kupavskii
Erdős matching conjecture for almost perfect matchings. Discret. Math. 346 (4) (2023)
Sergey Komech, Andrey Kupavskii, Alexei Vezolainen
Choosing optimal parameters for a distributed multi-constrained QoS routing. CoRR (2023)
Andrey Kupavskii, Fedor Noskov
Octopuses in the Boolean cube: Families with pairwise small intersections, part I. J. Comb. Theory, Ser. B 163 (2023)
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
On the maximum number of distinct intersections in an intersecting family. Discret. Math. 345 (4) (2022)
Peter Frankl, Andrey Kupavskii
Perfect matchings in down-sets. CoRR (2022)
Andrey Kupavskii, Stefan Weltge
Binary scalar products. J. Comb. Theory, Ser. B 156 (2022)
Sergei Kiselev, Andrey Kupavskii
Sharp bounds for the chromatic number of random Kneser graphs. J. Comb. Theory, Ser. B 157 (2022)
Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan
Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory, Ser. B 157 (2022)
Peter Frankl, Andrey Kupavskii
The Erdős Matching Conjecture and concentration inequalities. J. Comb. Theory, Ser. B 157 (2022)
Louis Esperet, Nathaniel Harms, Andrey Kupavskii
Sketching Distances in Monotone Graph Classes. APPROX/RANDOM (2022)
Andrey Kupavskii, Fedor Noskov
Octopuses in the Boolean cube: families with pairwise small intersections, part I. CoRR (2022)
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
On Anti-stochastic Properties of Unlabeled Graphs. WG (2022)
Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii
Intersection Theorems for Triangles. Discret. Comput. Geom. 68 (3) (2022)
Nóra Frankl, Andrey Kupavskii
Almost Sharp Bounds on the Number of Discrete Chains in the Plane. Comb. 42 (6) (2022)
Vera Bulankina, Andrey Kupavskii
Choice number of Kneser graphs. Discret. Math. 345 (11) (2022)
Louis Esperet, Nathaniel Harms, Andrey Kupavskii
Sketching Distances in Monotone Graph Classes. CoRR (2022)
Dmitriy Kolupaev, Andrey Kupavskii
Erdős Matching Conjecture for almost perfect matchings. CoRR (2022)
Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós
VC-saturated set systems. Eur. J. Comb. 104 (2022)
Peter Frankl, Andrey Kupavskii
Beyond the Erdős Matching Conjecture. Eur. J. Comb. 95 (2021)
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
On the maximum number of distinct intersections in an intersecting family. CoRR (2021)
Peter Frankl, Andrey Kupavskii
Uniform intersecting families with large covering number. CoRR (2021)
Andrey Kupavskii, Emo Welzl
Lower bounds for searching robots, some faulty. Distributed Comput. 34 (4) (2021)
Peter Frankl, Andrey Kupavskii
Diversity. J. Comb. Theory, Ser. A 182 (2021)
Nóra Frankl, Andrey Kupavskii
On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs. CoRR (2021)
Peter Frankl, Andrey Kupavskii
Almost Intersecting Families. Electron. J. Comb. 28 (2) (2021)
Vera Bulankina, Andrey Kupavskii
Choice number of Kneser graphs. CoRR (2021)
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
On anti-stochastic properties of unlabeled graphs. CoRR (2021)
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
Best possible bounds on the number of distinct differences in intersecting families. CoRR (2021)
Andrey Kupavskii, Stefan Weltge
Binary scalar products. CoRR (2020)
Peter Frankl, Andrey Kupavskii
Almost intersecting families. CoRR (2020)
Sergei Kiselev, Andrey Kupavskii
Trivial colors in colorings of Kneser graphs. CoRR (2020)
Andrey Kupavskii
The VC-Dimension of K-Vertex D-Polytopes. Comb. 40 (6) (2020)
Andrey Kupavskii, Nikita Zhivotovskiy
When are epsilon-nets small? J. Comput. Syst. Sci. 110 (2020)
Andrey Kupavskii, Dmitriy Zakharov
The right acute angles problem? Eur. J. Comb. 89 (2020)
Nóra Frankl, Andrey Kupavskii
Almost Sharp Bounds on the Number of Discrete Chains in the Plane. SoCG (2020)
Andrey Kupavskii
The VC-dimension of k-vertex d-polytopes. CoRR (2020)
Peter Frankl, Andrey Kupavskii
Intersection theorems for (-1, 0, 1)-vectors. CoRR (2020)
Peter Frankl, Andrey Kupavskii
Maximal degrees in subgraphs of Kneser graphs. CoRR (2020)
Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus
Rainbow structures in locally bounded colorings of graphs. Random Struct. Algorithms 56 (4) (2020)
Peter Frankl, Andrey Kupavskii
Sharp results concerning disjoint cross-intersecting families. Eur. J. Comb. 86 (2020)
Sergei Kiselev, Andrey Kupavskii
Rainbow matchings in k-partite hypergraphs. CoRR (2020)
Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel
Embedding graphs in Euclidean space. J. Comb. Theory, Ser. A 171 (2020)
Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii
Intersection theorems for triangles. CoRR (2020)
Peter Frankl, Andrey Kupavskii
Families of sets with no matchings of sizes 3 and 4. Eur. J. Comb. 75 (2019)
Ferdinand Ihringer, Andrey Kupavskii
Regular intersecting families. Discret. Appl. Math. 270 (2019)
Peter Frankl, Andrey Kupavskii
Beyond the Erdős Matching Conjecture. CoRR (2019)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. SoCG (2019)
Peter Frankl, Andrey Kupavskii
Incompatible Intersection Properties. Comb. 39 (6) (2019)
Mónika Csikós, Nabil H. Mustafa, Andrey Kupavskii
Tight Lower Bounds on the VC-dimension of Geometric Set Systems. J. Mach. Learn. Res. 20 (2019)
Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. 28 (2) (2019)
Peter Frankl, Andrey Kupavskii
Simple juntas for shifted families. CoRR (2019)
Andrey Kupavskii
Degree versions of theorems on intersecting families via stability. J. Comb. Theory, Ser. A 168 (2019)
Peter Frankl, Andrey Kupavskii
Sharp results concerning disjoint cross-intersecting families. CoRR (2019)
Andrey Kupavskii, János Pach, István Tomon
On the Size of K-Cross-Free Families. Comb. 39 (1) (2019)
Peter Frankl, Andrey Kupavskii
Two problems on matchings in set families - In the footsteps of Erdős and Kleitman. J. Comb. Theory, Ser. B 138 (2019)
Andrey Kupavskii
Diversity of uniform intersecting families. Eur. J. Comb. 74 (2018)
Andrey Kupavskii, Dmitriy Zakharov
Regular bipartite graphs and intersecting families. J. Comb. Theory, Ser. A 155 (2018)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. CoRR (2018)
Andrey Kupavskii
Degree versions of theorems on intersecting families via stability. CoRR (2018)
Andrey Kupavskii, Dmitry A. Shabanov
Colourings of Uniform Hypergraphs with Large Girth and Applications. Comb. Probab. Comput. 27 (2) (2018)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings with noncongruent triangles. Eur. J. Comb. 73 (2018)
Mónika Csikós, Andrey Kupavskii, Nabil H. Mustafa
Optimal Bounds on the VC-dimension. CoRR (2018)
Andrey Kupavskii
Structure and properties of large intersecting families. CoRR (2018)
Sergei Kiselev, Andrey Kupavskii
Sharp bounds for the chromatic number of random Kneser graphs. CoRR (2018)
Peter Frankl, Andrey Kupavskii
Counting Intersecting and Pairs of Cross-Intersecting Families. Comb. Probab. Comput. 27 (1) (2018)
Andrey Kupavskii
Random Kneser Graphs and Hypergraphs. Electron. J. Comb. 25 (4) (2018)
Peter Frankl, Andrey Kupavskii
pairwise disjoint members. J. Comb. Theory, Ser. A 157 (2018)
Andrey Kupavskii, Emo Welzl
Lower Bounds for Searching Robots, some Faulty. PODC (2018)
Peter Frankl, Andrey Kupavskii
Diversity. CoRR (2018)
Andrey Kupavskii, Maksim Zhukovskii
Short Monadic Second Order Sentences about Sparse Random Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Peter Frankl, Andrey Kupavskii
Incompatible intersection properties. CoRR (2018)
Peter Frankl, Andrey Kupavskii
Erdős-Ko-Rado theorem for {0, ±1}-vectors. J. Comb. Theory, Ser. A 155 (2018)
Peter Frankl, Andrey Kupavskii
New inequalities for families without k pairwise disjoint members. CoRR (2018)
Peter Frankl, Andrey Kupavskii
Uniform s-Cross-Intersecting Families. Comb. Probab. Comput. 26 (4) (2017)
Peter Frankl, Andrey Kupavskii
Partition-free families of sets. CoRR (2017)
Peter Frankl, Andrey Kupavskii
Counting intersecting and pairs of cross-intersecting families. CoRR (2017)
Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
Bounding the size of an almost-equidistant set in Euclidean space. CoRR (2017)
Andrey Kupavskii, János Pach
From Tarski's Plank Problem to Simultaneous Approximation. Am. Math. Mon. 124 (6) (2017)
Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel
Embedding graphs in Euclidean space. Electron. Notes Discret. Math. 61 (2017)
Andrey Kupavskii
Structure and properties of large intersecting families. CoRR (2017)
Andrey Kupavskii, Emo Welzl
Lower Bounds for Searching Robots, some Faulty. CoRR (2017)
Andrey Kupavskii, János Pach, Gábor Tardos
Tilings of the plane with unit area triangles of bounded diameter. CoRR (2017)
Ferdinand Ihringer, Andrey Kupavskii
Regular Intersecting Families. CoRR (2017)
Peter Frankl, Andrey Kupavskii
Families with no matchings of size s. Electron. Notes Discret. Math. 61 (2017)

Andrey Kupavskii.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrey Kupavskii