Andrey Kupavskii

156 papers A* 6A 3B 1Journal 146

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Cutting corners. J. Comb. Theory B Andrey Kupavskii, Arsenii Sagdeev, Dmitrii Zakharov
2026	J	`jnl`	Erdős-Ko-Rado type results for partitions via spread approximations. Eur. J. Comb. Andrey Kupavskii
2026	J	`jnl`	Frankl's diversity theorem for permutations. CoRR Eduard Inozemtsev, Andrey Kupavskii
2026	J	`jnl`	Intersecting families with covering number 3. J. Comb. Theory B Andrey Kupavskii
2026	J	`jnl`	Stability for binary scalar products. Eur. J. Comb. Andrey Kupavskii, Dmitry V. Tsarev
2026	J	`jnl`	The Erdős-Rado sunflower problem for vector spaces. Finite Fields Their Appl. Ferdinand Ihringer, Andrey Kupavskii
2026	A*	`conf`	Tree covers of size 2 for the Euclidean plane. SODA Artur Bikeev, Andrey Kupavskii, Maxim Turevskii
2026	J	`jnl`	Two questions on Kneser colorings. Discret. Math. Eduard Inozemtsev, Andrey Kupavskii
2025	J	`jnl`	A complete CoRR Elizaveta Iarovikova, Andrey Kupavskii
2025	J	`jnl`	A complete solution of the Erdős-Kleitman matching problem for n≤3s. CoRR Andrey Kupavskii, Georgy Sokolov
2025	J	`jnl`	Delta-system method: a survey. CoRR Andrey Kupavskii
2025	J	`jnl`	Intersection Problems and a Correlation Inequality for Integer Sequences. SIAM J. Discret. Math. Peter Frankl, Andrey Kupavskii
2025	J	`jnl`	Maximal Degrees in Subgraphs of Kneser Graphs. J. Graph Theory Peter Frankl, Andrey Kupavskii
2025	J	`jnl`	Near optimal edge partitioning via intersecting families. CoRR Alexander Yakunin, Stanislav Moiseev, Andrey Kupavskii
2025	J	`jnl`	Non-dissective coverings by planks. CoRR Andrey Kupavskii, János Pach
2025	J	`jnl`	Non-trivial r-wise agreeing families. Eur. J. Comb. Peter Frankl, Andrey Kupavskii
2025	J	`jnl`	Octopuses in the Boolean cube: Families with pairwise small intersections, part II. Discret. Math. Andrey Kupavskii, Fedor Noskov
2025	J	`jnl`	Satisfying sequences for rainbow partite matchings. CoRR Andrey Kupavskii, Elizaveta Popova
2025	A*	`conf`	Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. SODA Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
2025	J	`jnl`	The Hajnal-Rothschild problem. CoRR Peter Frankl, Andrey Kupavskii
2025	J	`jnl`	Tree covers of size CoRR Artur Bikeev, Andrey Kupavskii, Maxim Turevskii
2024	J	`jnl`	An almost complete t-intersection theorem for permutations. CoRR Andrey Kupavskii
2024	J	`jnl`	Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra. CoRR Grigorii Dakhno, Dmitry Gribanov, Nikita Kasianov, Anastasiia Kats, Andrey Kupavskii, Nikita Kuzmin
2024	J	`jnl`	Intersecting families with covering number 3. CoRR Andrey Kupavskii
2024	J	`jnl`	Intersection theorems for (-1,0,1)-vectors. Eur. J. Comb. Peter Frankl, Andrey Kupavskii
2024	J	`jnl`	Max-norm Ramsey theory. Eur. J. Comb. Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev
2024	J	`jnl`	On Isomorphism-Invariant Antistochastic Properties of Random Graphs. SIAM J. Discret. Math. Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
2024	J	`jnl`	Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
2024	J	`jnl`	Stability for binary scalar products. CoRR Andrey Kupavskii, Dmitry V. Tsarev
2024	J	`jnl`	Structure of non-trivial intersecting families. CoRR Andrey Kupavskii
2024	J	`jnl`	The Crossing Tverberg Theorem. Discret. Comput. Geom. Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2024	J	`jnl`	Tilings of Z with multisets of distances. Discret. Math. Andrey Kupavskii, Elizaveta Popova
2024	J	`jnl`	Trivial colors in colorings of Kneser graphs. Discret. Math. Sergei Kiselev, Andrey Kupavskii
2024	J	`jnl`	Two questions on Kneser colorings. CoRR Eduard Inozemtsev, Andrey Kupavskii
2023	J	`jnl`	Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Comb. Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2023	J	`jnl`	Choosing optimal parameters for a distributed multi-constrained QoS routing. CoRR Sergey Komech, Andrey Kupavskii, Alexei Vezolainen
2023	J	`jnl`	Erd\H os-Ko-Rado type results for partitions via spread approximations. CoRR Andrey Kupavskii
2023	J	`jnl`	Erdős matching conjecture for almost perfect matchings. Discret. Math. Dmitriy Kolupaev, Andrey Kupavskii
2023	J	`jnl`	Minimum number of partial triangulations. Eur. J. Comb. Andrey Kupavskii, Aleksei Volostnov, Yury Yarovikov
2023	J	`jnl`	Nearly k-Distance Sets. Discret. Comput. Geom. Nóra Frankl, Andrey Kupavskii
2023	J	`jnl`	Octopuses in the Boolean cube: Families with pairwise small intersections, part I. J. Comb. Theory B Andrey Kupavskii, Fedor Noskov
2023	J	`jnl`	Odd-distance and right-equidistant sets in the maximum and Manhattan metrics. Eur. J. Comb. Alexander Golovanov, Andrey Kupavskii, Arsenii Sagdeev
2023	J	`jnl`	Perfect matchings in down-sets. Discret. Math. Peter Frankl, Andrey Kupavskii
2023	J	`jnl`	Rainbow version of the Erdős Matching Conjecture via concentration. Comb. Theory Andrey Kupavskii
2023	J	`jnl`	Uniform intersecting families with large covering number. Eur. J. Comb. Peter Frankl, Andrey Kupavskii
2022	J	`jnl`	Almost Sharp Bounds on the Number of Discrete Chains in the Plane. Comb. Nóra Frankl, Andrey Kupavskii
2022	J	`jnl`	Binary scalar products. J. Comb. Theory B Andrey Kupavskii, Stefan Weltge
2022	J	`jnl`	Choice number of Kneser graphs. Discret. Math. Vera Bulankina, Andrey Kupavskii
2022	J	`jnl`	Erdős Matching Conjecture for almost perfect matchings. CoRR Dmitriy Kolupaev, Andrey Kupavskii
2022	J	`jnl`	Intersection Theorems for Triangles. Discret. Comput. Geom. Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii
2022	J	`jnl`	Octopuses in the Boolean cube: families with pairwise small intersections, part I. CoRR Andrey Kupavskii, Fedor Noskov
2022	B	`conf`	On Anti-stochastic Properties of Unlabeled Graphs. WG Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
2022	J	`jnl`	On the maximum number of distinct intersections in an intersecting family. Discret. Math. Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2022	J	`jnl`	Perfect matchings in down-sets. CoRR Peter Frankl, Andrey Kupavskii
2022	J	`jnl`	Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory B Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan
2022	J	`jnl`	Sharp bounds for the chromatic number of random Kneser graphs. J. Comb. Theory B Sergei Kiselev, Andrey Kupavskii
2022	A	`conf`	Sketching Distances in Monotone Graph Classes. APPROX/RANDOM Louis Esperet, Nathaniel Harms, Andrey Kupavskii
2022	J	`jnl`	Sketching Distances in Monotone Graph Classes. CoRR Louis Esperet, Nathaniel Harms, Andrey Kupavskii
2022	J	`jnl`	The Erdős Matching Conjecture and concentration inequalities. J. Comb. Theory B Peter Frankl, Andrey Kupavskii
2022	J	`jnl`	VC-saturated set systems. Eur. J. Comb. Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós
2021	J	`jnl`	Almost Intersecting Families. Electron. J. Comb. Peter Frankl, Andrey Kupavskii
2021	J	`jnl`	Best possible bounds on the number of distinct differences in intersecting families. CoRR Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2021	J	`jnl`	Beyond the Erdős Matching Conjecture. Eur. J. Comb. Peter Frankl, Andrey Kupavskii
2021	J	`jnl`	Choice number of Kneser graphs. CoRR Vera Bulankina, Andrey Kupavskii
2021	J	`jnl`	Diversity. J. Comb. Theory A Peter Frankl, Andrey Kupavskii
2021	J	`jnl`	Lower bounds for searching robots, some faulty. Distributed Comput. Andrey Kupavskii, Emo Welzl
2021	J	`jnl`	On anti-stochastic properties of unlabeled graphs. CoRR Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
2021	J	`jnl`	On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs. CoRR Nóra Frankl, Andrey Kupavskii
2021	J	`jnl`	On the maximum number of distinct intersections in an intersecting family. CoRR Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2021	J	`jnl`	Uniform intersecting families with large covering number. CoRR Peter Frankl, Andrey Kupavskii
2020	A*	`conf`	Almost Sharp Bounds on the Number of Discrete Chains in the Plane. SoCG Nóra Frankl, Andrey Kupavskii
2020	J	`jnl`	Almost intersecting families. CoRR Peter Frankl, Andrey Kupavskii
2020	J	`jnl`	Binary scalar products. CoRR Andrey Kupavskii, Stefan Weltge
2020	J	`jnl`	Embedding graphs in Euclidean space. J. Comb. Theory A Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel
2020	J	`jnl`	Intersection theorems for (-1, 0, 1)-vectors. CoRR Peter Frankl, Andrey Kupavskii
2020	J	`jnl`	Intersection theorems for triangles. CoRR Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii
2020	J	`jnl`	Maximal degrees in subgraphs of Kneser graphs. CoRR Peter Frankl, Andrey Kupavskii
2020	J	`jnl`	Rainbow matchings in k-partite hypergraphs. CoRR Sergei Kiselev, Andrey Kupavskii
2020	J	`jnl`	Rainbow structures in locally bounded colorings of graphs. Random Struct. Algorithms Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus
2020	J	`jnl`	Sharp results concerning disjoint cross-intersecting families. Eur. J. Comb. Peter Frankl, Andrey Kupavskii
2020	J	`jnl`	The VC-Dimension of K-Vertex D-Polytopes. Comb. Andrey Kupavskii
2020	J	`jnl`	The VC-dimension of k-vertex d-polytopes. CoRR Andrey Kupavskii
2020	J	`jnl`	The right acute angles problem? Eur. J. Comb. Andrey Kupavskii, Dmitriy Zakharov
2020	J	`jnl`	Trivial colors in colorings of Kneser graphs. CoRR Sergei Kiselev, Andrey Kupavskii
2020	J	`jnl`	When are epsilon-nets small? J. Comput. Syst. Sci. Andrey Kupavskii, Nikita Zhivotovskiy
2019	J	`jnl`	Beyond the Erdős Matching Conjecture. CoRR Peter Frankl, Andrey Kupavskii
2019	J	`jnl`	Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
2019	J	`jnl`	Degree versions of theorems on intersecting families via stability. J. Comb. Theory A Andrey Kupavskii
2019	J	`jnl`	Families of sets with no matchings of sizes 3 and 4. Eur. J. Comb. Peter Frankl, Andrey Kupavskii
2019	J	`jnl`	Incompatible Intersection Properties. Comb. Peter Frankl, Andrey Kupavskii
2019	J	`jnl`	On the Size of K-Cross-Free Families. Comb. Andrey Kupavskii, János Pach, István Tomon
2019	J	`jnl`	Regular intersecting families. Discret. Appl. Math. Ferdinand Ihringer, Andrey Kupavskii
2019	J	`jnl`	Sharp results concerning disjoint cross-intersecting families. CoRR Peter Frankl, Andrey Kupavskii
2019	J	`jnl`	Simple juntas for shifted families. CoRR Peter Frankl, Andrey Kupavskii
2019	A*	`conf`	The Crossing Tverberg Theorem. SoCG Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2019	J	`jnl`	Tight Lower Bounds on the VC-dimension of Geometric Set Systems. J. Mach. Learn. Res. Mónika Csikós, Nabil H. Mustafa, Andrey Kupavskii
2019	J	`jnl`	Two problems on matchings in set families - In the footsteps of Erdős and Kleitman. J. Comb. Theory B Peter Frankl, Andrey Kupavskii
2018	J	`jnl`	Colourings of Uniform Hypergraphs with Large Girth and Applications. Comb. Probab. Comput. Andrey Kupavskii, Dmitry A. Shabanov
2018	J	`jnl`	Counting Intersecting and Pairs of Cross-Intersecting Families. Comb. Probab. Comput. Peter Frankl, Andrey Kupavskii
2018	J	`jnl`	Degree versions of theorems on intersecting families via stability. CoRR Andrey Kupavskii
2018	J	`jnl`	Diversity of uniform intersecting families. Eur. J. Comb. Andrey Kupavskii
2018	J	`jnl`	Diversity. CoRR Peter Frankl, Andrey Kupavskii
2018	J	`jnl`	Erdős-Ko-Rado theorem for {0, ±1}-vectors. J. Comb. Theory A Peter Frankl, Andrey Kupavskii
2018	J	`jnl`	Incompatible intersection properties. CoRR Peter Frankl, Andrey Kupavskii
2018	A*	`conf`	Lower Bounds for Searching Robots, some Faulty. PODC Andrey Kupavskii, Emo Welzl
2018	J	`jnl`	New inequalities for families without J. Comb. Theory A Peter Frankl, Andrey Kupavskii
2018	J	`jnl`	New inequalities for families without k pairwise disjoint members. CoRR Peter Frankl, Andrey Kupavskii
2018	J	`jnl`	Optimal Bounds on the VC-dimension. CoRR Mónika Csikós, Andrey Kupavskii, Nabil H. Mustafa
2018	J	`jnl`	Random Kneser Graphs and Hypergraphs. Electron. J. Comb. Andrey Kupavskii
2018	J	`jnl`	Regular bipartite graphs and intersecting families. J. Comb. Theory A Andrey Kupavskii, Dmitriy Zakharov
2018	J	`jnl`	Sharp bounds for the chromatic number of random Kneser graphs. CoRR Sergei Kiselev, Andrey Kupavskii
2018	J	`jnl`	Short Monadic Second Order Sentences about Sparse Random Graphs. SIAM J. Discret. Math. Andrey Kupavskii, Maksim Zhukovskii
2018	J	`jnl`	Structure and properties of large intersecting families. CoRR Andrey Kupavskii
2018	J	`jnl`	The Crossing Tverberg Theorem. CoRR Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2018	J	`jnl`	Tilings with noncongruent triangles. Eur. J. Comb. Andrey Kupavskii, János Pach, Gábor Tardos
2017	J	`jnl`	A size-sensitive inequality for cross-intersecting families. Eur. J. Comb. Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	Bounding the size of an almost-equidistant set in Euclidean space. CoRR Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
2017	J	`jnl`	Controlling Lipschitz functions. CoRR Andrey Kupavskii, János Pach, Gábor Tardos
2017	J	`jnl`	Counting intersecting and pairs of cross-intersecting families. CoRR Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	Diversity of uniform intersecting families. CoRR Andrey Kupavskii
2017	J	`jnl`	Embedding graphs in Euclidean space. Electron. Notes Discret. Math. Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel
2017	J	`jnl`	Families of sets with no matchings of sizes 3 and 4. CoRR Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	Families of vectors without antipodal pairs. CoRR Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	Families with no matchings of size s. Electron. Notes Discret. Math. Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	Families with no s pairwise disjoint sets. J. Lond. Math. Soc. Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	From Tarski's Plank Problem to Simultaneous Approximation. Am. Math. Mon. Andrey Kupavskii, János Pach
2017	J	`jnl`	Lower Bounds for Searching Robots, some Faulty. CoRR Andrey Kupavskii, Emo Welzl
2017	J	`jnl`	Partition-free families of sets. CoRR Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	Regular Intersecting Families. CoRR Ferdinand Ihringer, Andrey Kupavskii
2017	J	`jnl`	Structure and properties of large intersecting families. CoRR Andrey Kupavskii
2017	J	`jnl`	Tilings of the plane with unit area triangles of bounded diameter. CoRR Andrey Kupavskii, János Pach, Gábor Tardos
2017	J	`jnl`	Tilings with noncongruent triangles. CoRR Andrey Kupavskii, János Pach, Gábor Tardos
2017	J	`jnl`	Uniform s-Cross-Intersecting Families. Comb. Probab. Comput. Peter Frankl, Andrey Kupavskii
2017	J	`jnl`	When are epsilon-nets small? CoRR Andrey Kupavskii, Nikita Zhivotovskiy
2016	J	`jnl`	A size-sensitive inequality for cross-intersecting families. CoRR Peter Frankl, Andrey Kupavskii
2016	J	`jnl`	Families with no s pairwise disjoint sets. CoRR Peter Frankl, Andrey Kupavskii
2016	J	`jnl`	Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families. CoRR Peter Frankl, Andrey Kupavskii
2016	A*	`conf`	New Lower Bounds for epsilon-Nets. SoCG Andrey Kupavskii, Nabil H. Mustafa, János Pach
2016	J	`jnl`	On random subgraphs of Kneser and Schrijver graphs. J. Comb. Theory A Andrey Kupavskii
2016	J	`jnl`	Random Kneser graphs and hypergraphs. CoRR Andrey Kupavskii
2016	J	`jnl`	Regular bipartite graphs and intersecting families. CoRR Andrey Kupavskii, Dmitriy Zakharov
2016	J	`jnl`	Short monadic second order sentences about sparse random graphs. CoRR Andrey Kupavskii, Maksim Zhukovskii
2016	J	`jnl`	The number of double-normals in space. Discret. Comput. Geom. Andrey Kupavskii
2016	J	`jnl`	Two problems of P. Erdős on matchings in set families. CoRR Peter Frankl, Andrey Kupavskii
2016	J	`jnl`	Uniform s-cross-intersecting families. CoRR Peter Frankl, Andrey Kupavskii
2015	J	`jnl`	Erdős-Ko-Rado theorem for {0, ±: 1}-vectors. CoRR Peter Frankl, Andrey Kupavskii
2014	J	`jnl`	Diameter Graphs in ℝ Discret. Comput. Geom. Andrey Kupavskii
2014	J	`jnl`	Number of double-normal pairs in space. CoRR Andrey Kupavskii
2014	J	`jnl`	Two notions of unit distance graphs. J. Comb. Theory A Noga Alon, Andrey Kupavskii
2013	J	`jnl`	Diameter graphs in ℝ CoRR Andrey Kupavskii
2013	J	`jnl`	Distance graphs with large chromatic number and arbitrary girth. CoRR Andrey Kupavskii
2013	A	`conf`	Predicting the Audience Size of a Tweet. ICWSM Andrey Kupavskii, Alexey Umnov, Gleb Gusev, Pavel Serdyukov
2013	J	`jnl`	The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model. Internet Math. Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali
2013	J	`jnl`	The distribution of second degrees in the Buckley-Osthus random graph model. CoRR Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali
2013	J	`jnl`	Two notions of unit distance graphs. CoRR Noga Alon, Andrey Kupavskii
2012	A	`conf`	Prediction of retweet cascade size over time. CIKM Andrey Kupavskii, Liudmila Ostroumova, Alexey Umnov, Svyatoslav Usachev, Pavel Serdyukov, Gleb Gusev, Andrey Kustarev