According to our database
1,
Andrey Kupavskii
authored at least 100 papers
between 2009 and 2025.
Collaborative distances:
2025
Octopuses in the Boolean cube: Families with pairwise small intersections, part II.
Discret. Math., 2025
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
The Crossing Tverberg Theorem.
Discret. Comput. Geom., September, 2024
Trivial colors in colorings of Kneser graphs.
Discret. Math., April, 2024
Intersection theorems for (-1,0,1)-vectors.
Eur. J. Comb., March, 2024
On Isomorphism-Invariant Antistochastic Properties of Random Graphs.
SIAM J. Discret. Math., 2024
Tilings of Z with multisets of distances.
Discret. Math., 2024
Structure of non-trivial intersecting families.
CoRR, 2024
Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra.
CoRR, 2024
Two questions on Kneser colorings.
CoRR, 2024
An almost complete t-intersection theorem for permutations.
CoRR, 2024
Intersecting families with covering number 3.
CoRR, 2024
Stability for binary scalar products.
CoRR, 2024
2023
Robust Algebraic Connectivity.
Program. Comput. Softw., December, 2023
Octopuses in the Boolean cube: Families with pairwise small intersections, part I.
J. Comb. Theory B, November, 2023
Uniform intersecting families with large covering number.
Eur. J. Comb., October, 2023
Discret. Comput. Geom., October, 2023
Perfect matchings in down-sets.
Discret. Math., May, 2023
Erdős matching conjecture for almost perfect matchings.
Discret. Math., April, 2023
Minimum number of partial triangulations.
Eur. J. Comb., 2023
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics.
Eur. J. Comb., 2023
Best possible bounds on the number of distinct differences in intersecting families.
Eur. J. Comb., 2023
Choosing optimal parameters for a distributed multi-constrained QoS routing.
CoRR, 2023
Erd\H os-Ko-Rado type results for partitions via spread approximations.
CoRR, 2023
Rainbow version of the Erdős Matching Conjecture via concentration.
Comb. Theory, 2023
2022
Almost Sharp Bounds on the Number of Discrete Chains in the Plane.
Comb., December, 2022
Sharp bounds for the chromatic number of random Kneser graphs.
J. Comb. Theory B, 2022
Reconstructing the degree sequence of a sparse graph from a partial deck.
J. Comb. Theory B, 2022
The Erdős Matching Conjecture and concentration inequalities.
J. Comb. Theory B, 2022
VC-saturated set systems.
Eur. J. Comb., 2022
On the maximum number of distinct intersections in an intersecting family.
Discret. Math., 2022
Choice number of Kneser graphs.
Discret. Math., 2022
Intersection Theorems for Triangles.
Discret. Comput. Geom., 2022
On Anti-stochastic Properties of Unlabeled Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022
Sketching Distances in Monotone Graph Classes.
Proceedings of the Approximation, 2022
2021
Beyond the Erdős Matching Conjecture.
Eur. J. Comb., 2021
Lower bounds for searching robots, some faulty.
Distributed Comput., 2021
On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs.
CoRR, 2021
Almost Intersecting Families.
Electron. J. Comb., 2021
2020
Rainbow structures in locally bounded colorings of graphs.
Random Struct. Algorithms, July, 2020
Embedding graphs in Euclidean space.
J. Comb. Theory A, 2020
When are epsilon-nets small?
J. Comput. Syst. Sci., 2020
The right acute angles problem?
Eur. J. Comb., 2020
Sharp results concerning disjoint cross-intersecting families.
Eur. J. Comb., 2020
Intersection theorems for (-1, 0, 1)-vectors.
CoRR, 2020
Maximal degrees in subgraphs of Kneser graphs.
CoRR, 2020
Rainbow matchings in k-partite hypergraphs.
CoRR, 2020
The VC-Dimension of K-Vertex D-Polytopes.
Comb., 2020
2019
Tight Lower Bounds on the VC-dimension of Geometric Set Systems.
J. Mach. Learn. Res., 2019
Degree versions of theorems on intersecting families via stability.
J. Comb. Theory A, 2019
Two problems on matchings in set families - In the footsteps of Erdős and Kleitman.
J. Comb. Theory B, 2019
Families of sets with no matchings of sizes 3 and 4.
Eur. J. Comb., 2019
Regular intersecting families.
Discret. Appl. Math., 2019
Bounding the Size of an Almost-Equidistant Set in Euclidean Space.
Comb. Probab. Comput., 2019
Simple juntas for shifted families.
CoRR, 2019
On the Size of K-Cross-Free Families.
Comb., 2019
Incompatible Intersection Properties.
Comb., 2019
2018
Short Monadic Second Order Sentences about Sparse Random Graphs.
SIAM J. Discret. Math., 2018
Regular bipartite graphs and intersecting families.
J. Comb. Theory A, 2018
New inequalities for families without <i>k</i> pairwise disjoint members.
J. Comb. Theory A, 2018
Erdős-Ko-Rado theorem for {0, ±1}-vectors.
J. Comb. Theory A, 2018
Tilings with noncongruent triangles.
Eur. J. Comb., 2018
Diversity of uniform intersecting families.
Eur. J. Comb., 2018
Colourings of Uniform Hypergraphs with Large Girth and Applications.
Comb. Probab. Comput., 2018
Counting Intersecting and Pairs of Cross-Intersecting Families.
Comb. Probab. Comput., 2018
Optimal Bounds on the VC-dimension.
CoRR, 2018
New inequalities for families without k pairwise disjoint members.
CoRR, 2018
Random Kneser Graphs and Hypergraphs.
Electron. J. Comb., 2018
2017
From Tarski's Plank Problem to Simultaneous Approximation.
Am. Math. Mon., 2017
Families with no s pairwise disjoint sets.
J. Lond. Math. Soc., 2017
Families with no matchings of size s.
Electron. Notes Discret. Math., 2017
A size-sensitive inequality for cross-intersecting families.
Eur. J. Comb., 2017
Uniform s-Cross-Intersecting Families.
Comb. Probab. Comput., 2017
Tilings of the plane with unit area triangles of bounded diameter.
CoRR, 2017
Structure and properties of large intersecting families.
CoRR, 2017
Partition-free families of sets.
CoRR, 2017
Families of vectors without antipodal pairs.
CoRR, 2017
Controlling Lipschitz functions.
CoRR, 2017
Proof of Schur's Conjecture in ℝ D.
Comb., 2017
2016
On random subgraphs of Kneser and Schrijver graphs.
J. Comb. Theory A, 2016
The number of double-normals in space.
Discret. Comput. Geom., 2016
Two problems of P. Erdős on matchings in set families.
CoRR, 2016
Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families.
CoRR, 2016
New Lower Bounds for epsilon-Nets.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
Simultaneous Approximation of Polynomials.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
2014
Two notions of unit distance graphs.
J. Comb. Theory A, 2014
Diameter Graphs in ℝ<sup>4</sup>.
Discret. Comput. Geom., 2014
Number of double-normal pairs in space.
CoRR, 2014
Proof of Schur's conjecture in ℝ<sup>d</sup>.
CoRR, 2014
2013
The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model.
Internet Math., 2013
New bounds for the distance Ramsey number.
Discret. Math., 2013
Distance graphs with large chromatic number and arbitrary girth.
CoRR, 2013
Predicting the Audience Size of a Tweet.
Proceedings of the Seventh International Conference on Weblogs and Social Media, 2013
2012
Prediction of retweet cascade size over time.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012
2011
On r-colorability of random hypergraphs.
CoRR, 2011
2010
Counterexamples to Borsuk's conjecture on spheres of small radii.
CoRR, 2010
2009
On the chromatic numbers of small-dimensional Euclidean spaces.
Electron. Notes Discret. Math., 2009
