A. Kupavskii

Most-cited papers

The Erdős Matching Conjecture and concentration inequalities
P. Frankl, A. Kupavskii
2018J. Comb. Theory B122 citations
Semantic Scholar
Spread approximations for forbidden intersections problems
A. Kupavskii, D. Zakharov
2022Advances in Mathematics55 citations Open access
Semantic Scholar
Diversity of uniform intersecting families
A. Kupavskii
2017European journal of combinatorics (Print)32 citations Open access
Semantic Scholar
Erdős Matching Conjecture for almost perfect matchings
D. Kolupaev, A. Kupavskii
2022Discrete Mathematics27 citations Open access
Semantic Scholar
Counting Intersecting and Pairs of Cross-Intersecting Families
P. Frankl, A. Kupavskii
2017Combinatorics, probability & computing25 citations Open access
Semantic Scholar
Tight Lower Bounds on the VC-dimension of Geometric Set Systems
M. Csikós, Nabil H. Mustafa, A. Kupavskii
2019Journal of machine learning research23 citations
Semantic Scholar
Simple juntas for shifted families
P. Frankl, A. Kupavskii
2019Discrete Analysis21 citations Open access
Semantic Scholar
Families of sets with no matchings of sizes 3 and 4
P. Frankl, A. Kupavskii
2017European journal of combinatorics (Print)21 citations Open access
Semantic Scholar
Degree versions of theorems on intersecting families via stability
A. Kupavskii
2018arXiv.org20 citations
Semantic Scholar
Regular Intersecting Families
F. Ihringer, A. Kupavskii
2017Discrete Applied Mathematics20 citations Open access
Semantic Scholar
Structure and properties of large intersecting families
A. Kupavskii
2017arXiv.org20 citations
Semantic Scholar
Rainbow version of the Erdős Matching Conjecture via concentration
A. Kupavskii
2023Combinatorial Theory19 citations Open access
Semantic Scholar
Rainbow structures in locally bounded colorings of graphs
Jaehoon Kim, D. Kühn, A. Kupavskii, Deryk Osthus
2018Random Struct. Algorithms19 citations Open access
Semantic Scholar
Lower bounds for searching robots, some faulty
A. Kupavskii, E. Welzl
2017Distributed computing19 citations Open access
Semantic Scholar
Sharp bounds for the chromatic number of random Kneser graphs
S. Kiselev, A. Kupavskii
2018J. Comb. Theory B17 citations Open access
Semantic Scholar
Embedding graphs in Euclidean space
Nóra Frankl, A. Kupavskii, K. Swanepoel
2017Electron. Notes Discret. Math.17 citations Open access
Semantic Scholar
Intersection theorems for uniform subfamilies of hereditary families
A. Kupavskii
202314 citations
Semantic Scholar
All finite sets are Ramsey in the maximum norm
A. Kupavskii, Arsenii Sagdeev
2020Forum of Mathematics, Sigma14 citations Open access
Semantic Scholar
The Extremal Number of Surfaces
A. Kupavskii, A. Polyanskii, István Tomon, D. Zakharov
2020International mathematics research notices14 citations Open access
Semantic Scholar
Sharp results concerning disjoint cross-intersecting families
P. Frankl, A. Kupavskii
2019European journal of combinatorics (Print)14 citations Open access
Semantic Scholar
New inequalities for families without k pairwise disjoint members
P. Frankl, A. Kupavskii
2018Journal of Combinatorial Theory13 citations Open access
Semantic Scholar
Families of vectors without antipodal pairs
P. Frankl, A. Kupavskii
2017Studia scientiarum mathematicarum Hungarica (Print)13 citations Open access
Semantic Scholar
Sketching Distances in Monotone Graph Classes
L. Esperet, Nathaniel Harms, A. Kupavskii
2022International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques12 citations Open access
Semantic Scholar
On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs
Nóra Frankl, A. Kupavskii
2021arXiv.org12 citations
Semantic Scholar
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
S. Bhore, Balázs Keszegh, A. Kupavskii, Hung Le +3 more
2024ACM-SIAM Symposium on Discrete Algorithms11 citations
Semantic Scholar
Linear dependencies, polynomial factors in the Duke–Erdős forbidden sunflower problem
A. Kupavskii, F. Noskov
2024Forum of Mathematics, Sigma11 citations Open access
Semantic Scholar
Rainbow matchings in k ‐partite hypergraphs
S. Kiselev, A. Kupavskii
2020Bulletin of the London Mathematical Society11 citations Open access
Semantic Scholar
Almost Sharp Bounds on the Number of Discrete Chains in the Plane
Nóra Frankl, A. Kupavskii
2019Combinatorica11 citations Open access
Semantic Scholar
Optimal Bounds on the VC-dimension
M. Csikós, A. Kupavskii, Nabil H. Mustafa
2018arXiv.org11 citations
Semantic Scholar
Colourings of Uniform Hypergraphs with Large Girth and Applications
A. Kupavskii, D. Shabanov
2017Combinatorics, probability & computing11 citations Open access
Semantic Scholar
Max-norm Ramsey theory
Nóra Frankl, A. Kupavskii, Arsenii Sagdeev
2021European journal of combinatorics (Print)10 citations Open access
Semantic Scholar
Tilings with noncongruent triangles
A. Kupavskii, J. Pach, G. Tardos
2017European journal of combinatorics (Print)10 citations Open access
Semantic Scholar
Partition‐free families of sets
P. Frankl, A. Kupavskii
2017Proceedings of the London Mathematical Society10 citations Open access
Semantic Scholar
On the maximum number of distinct intersections in an intersecting family
P. Frankl, S. Kiselev, A. Kupavskii
2021Discrete Mathematics9 citations Open access
Semantic Scholar
VC-saturated set systems
Nóra Frankl, S. Kiselev, A. Kupavskii, Balázs Patkós
2020European journal of combinatorics (Print)9 citations Open access
Semantic Scholar
Maximal Degrees in Subgraphs of Kneser Graphs
P. Frankl, A. Kupavskii
2020Journal of Graph Theory9 citations Open access
Semantic Scholar
Tilings of the plane with unit area triangles of bounded diameter
A. Kupavskii, J. Pach, G. Tardos
2017arXiv.org9 citations Open access
Semantic Scholar
When are epsilon-nets small?
A. Kupavskii, Nikita Zhivotovskiy
2017Journal of computer and system sciences (Print)9 citations Open access
Semantic Scholar
Intersecting Families of Spanning Trees
Peter Frankl, Glenn H. Hurlbert, F. Ihringer, A. Kupavskii +3 more
20258 citations
Semantic Scholar
Uniform intersecting families with large covering number
P. Frankl, A. Kupavskii
2021European journal of combinatorics (Print)8 citations Open access
Semantic Scholar
Almost intersecting families
P. Frankl, A. Kupavskii
2020Electronic Journal of Combinatorics8 citations Open access
Semantic Scholar
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics
A. Golovanov, A. Kupavskii, Arsenii Sagdeev
2022European journal of combinatorics (Print)7 citations Open access
Semantic Scholar
Beyond the Erdős Matching Conjecture
P. Frankl, A. Kupavskii
2021European journal of combinatorics (Print)7 citations Open access
Semantic Scholar
The VC-Dimension of K-Vertex D-Polytopes
A. Kupavskii
2020Combinatorica7 citations Open access
Semantic Scholar
Best possible bounds on the number of distinct differences in intersecting families
P. Frankl, S. Kiselev, A. Kupavskii
2021European journal of combinatorics (Print)6 citations Open access
Semantic Scholar
Binary scalar products
A. Kupavskii, Stefan Weltge
2020J. Comb. Theory B6 citations Open access
Semantic Scholar
The Crossing Tverberg Theorem
R. Fulek, Bernd Gärtner, A. Kupavskii, P. Valtr +1 more
2018Discrete & Computational Geometry6 citations
Semantic Scholar
Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
Nóra Frankl, A. Kupavskii, Arsenii Sagdeev
20225 citations Open access
Semantic Scholar
Reconstructing the degree sequence of a sparse graph from a partial deck
Carla Groenland, Tom Johnston, A. Kupavskii, Kitty Meeks +2 more
2021J. Comb. Theory B5 citations Open access
Semantic Scholar
The right acute angles problem?
A. Kupavskii, D. Zakharov
2019European journal of combinatorics (Print)5 citations Open access
Semantic Scholar