default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrey Kupavskii
Andrei Kupavskii – Andrey B. Kupavskii
Person information
- affiliation: Moscow Institute of Physics and Technology, Russia
- affiliation: Ecole Polytechnique Fédérale de Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Sergei Kiselev, Andrey Kupavskii:
Trivial colors in colorings of Kneser graphs. Discret. Math. 347(4): 113869 (2024)- [j62]Andrey Kupavskii, Elizaveta Popova:
Tilings of Z with multisets of distances. Discret. Math. 347(9): 114053 (2024) - [j61]Peter Frankl, Andrey Kupavskii:
Intersection theorems for (-1,0,1)-vectors. Eur. J. Comb. 117: 103830 (2024) - [j60]Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev:
Max-norm Ramsey theory. Eur. J. Comb. 118: 103918 (2024) - [i69]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 abs/2404.05045 (2024) - [i68]Andrey Kupavskii, Dmitry V. Tsarev:
Stability for binary scalar products. CoRR abs/2404.17933 (2024) - [i67]Andrey Kupavskii:
Intersecting families with covering number 3. CoRR abs/2405.02621 (2024) - [i66]Andrey Kupavskii:
An almost complete t-intersection theorem for permutations. CoRR abs/2405.07843 (2024) - [i65]Eduard Inozemtsev, Andrey Kupavskii:
Two questions on Kneser colorings. CoRR abs/2405.08797 (2024) - 2023
- [j59]Nóra Frankl
, Andrey Kupavskii:
Nearly k-Distance Sets. Discret. Comput. Geom. 70(3): 455-494 (2023) - [j58]Dmitriy Kolupaev, Andrey Kupavskii:
Erdős matching conjecture for almost perfect matchings. Discret. Math. 346(4): 113304 (2023) - [j57]Peter Frankl, Andrey Kupavskii:
Perfect matchings in down-sets. Discret. Math. 346(5): 113323 (2023) - [j56]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Comb. 107: 103601 (2023) - [j55]Alexander Golovanov, Andrey Kupavskii, Arsenii Sagdeev:
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics. Eur. J. Comb. 107: 103603 (2023) - [j54]Andrey Kupavskii, Aleksei Volostnov, Yury Yarovikov:
Minimum number of partial triangulations. Eur. J. Comb. 108: 103636 (2023) - [j53]Peter Frankl, Andrey Kupavskii:
Uniform intersecting families with large covering number. Eur. J. Comb. 113: 103747 (2023) - [j52]Andrey Kupavskii, Fedor Noskov:
Octopuses in the Boolean cube: Families with pairwise small intersections, part I. J. Comb. Theory B 163: 308-331 (2023) - [j51]Ilya A. Kuruzov, Alexander Rogozin, S. A. Chezhegov, Andrey B. Kupavskii:
Robust Algebraic Connectivity. Program. Comput. Softw. 49(6): 525-534 (2023) - [i64]Andrey Kupavskii:
Erd\H os-Ko-Rado type results for partitions via spread approximations. CoRR abs/2309.00097 (2023) - [i63]Sergey Komech, Andrey Kupavskii, Alexei Vezolainen:
Choosing optimal parameters for a distributed multi-constrained QoS routing. CoRR abs/2310.07350 (2023) - 2022
- [j50]Nóra Frankl, Andrey Kupavskii:
Almost Sharp Bounds on the Number of Discrete Chains in the Plane. Comb. 42(6): 1119-1143 (2022) - [j49]Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
Intersection Theorems for Triangles. Discret. Comput. Geom. 68(3): 728-737 (2022) - [j48]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
On the maximum number of distinct intersections in an intersecting family. Discret. Math. 345(4): 112757 (2022) - [j47]Vera Bulankina, Andrey Kupavskii:
Choice number of Kneser graphs. Discret. Math. 345(11): 113097 (2022) - [j46]Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós:
VC-saturated set systems. Eur. J. Comb. 104: 103528 (2022) - [j45]Andrey Kupavskii, Stefan Weltge:
Binary scalar products. J. Comb. Theory B 156: 18-30 (2022) - [j44]Sergei Kiselev, Andrey Kupavskii:
Sharp bounds for the chromatic number of random Kneser graphs. J. Comb. Theory B 157: 96-122 (2022) - [j43]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 B 157: 283-293 (2022) - [j42]Peter Frankl, Andrey Kupavskii:
The Erdős Matching Conjecture and concentration inequalities. J. Comb. Theory B 157: 366-400 (2022) - [c9]Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
Sketching Distances in Monotone Graph Classes. APPROX/RANDOM 2022: 18:1-18:23 - [c8]Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii:
On Anti-stochastic Properties of Unlabeled Graphs. WG 2022: 300-312 - [i62]Peter Frankl, Andrey Kupavskii:
Perfect matchings in down-sets. CoRR abs/2201.03865 (2022) - [i61]Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
Sketching Distances in Monotone Graph Classes. CoRR abs/2202.09253 (2022) - [i60]Dmitriy Kolupaev, Andrey Kupavskii:
Erdős Matching Conjecture for almost perfect matchings. CoRR abs/2206.01526 (2022) - [i59]Andrey Kupavskii, Fedor Noskov:
Octopuses in the Boolean cube: families with pairwise small intersections, part I. CoRR abs/2209.04756 (2022) - 2021
- [j41]Peter Frankl, Andrey Kupavskii:
Almost Intersecting Families. Electron. J. Comb. 28(2): 2 (2021) - [j40]Andrey Kupavskii, Emo Welzl:
Lower bounds for searching robots, some faulty. Distributed Comput. 34(4): 229-237 (2021) - [j39]Peter Frankl, Andrey Kupavskii:
Beyond the Erdős Matching Conjecture. Eur. J. Comb. 95: 103338 (2021) - [j38]Peter Frankl, Andrey Kupavskii:
Diversity. J. Comb. Theory A 182: 105468 (2021) - [i58]Peter Frankl, Andrey Kupavskii:
Uniform intersecting families with large covering number. CoRR abs/2106.05344 (2021) - [i57]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
Best possible bounds on the number of distinct differences in intersecting families. CoRR abs/2106.05355 (2021) - [i56]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
On the maximum number of distinct intersections in an intersecting family. CoRR abs/2108.00479 (2021) - [i55]Vera Bulankina, Andrey Kupavskii:
Choice number of Kneser graphs. CoRR abs/2108.00502 (2021) - [i54]Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii:
On anti-stochastic properties of unlabeled graphs. CoRR abs/2112.04395 (2021) - [i53]Nóra Frankl, Andrey Kupavskii:
On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs. CoRR abs/2112.10245 (2021) - 2020
- [j37]Andrey Kupavskii:
The VC-Dimension of K-Vertex D-Polytopes. Comb. 40(6): 869-874 (2020) - [j36]Peter Frankl, Andrey Kupavskii:
Sharp results concerning disjoint cross-intersecting families. Eur. J. Comb. 86: 103089 (2020) - [j35]Andrey Kupavskii, Dmitriy Zakharov:
The right acute angles problem? Eur. J. Comb. 89: 103144 (2020) - [j34]Andrey Kupavskii, Nikita Zhivotovskiy:
When are epsilon-nets small? J. Comput. Syst. Sci. 110: 22-36 (2020) - [j33]Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel:
Embedding graphs in Euclidean space. J. Comb. Theory A 171 (2020) - [j32]Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus:
Rainbow structures in locally bounded colorings of graphs. Random Struct. Algorithms 56(4): 1171-1204 (2020) - [c7]Nóra Frankl, Andrey Kupavskii:
Almost Sharp Bounds on the Number of Discrete Chains in the Plane. SoCG 2020: 48:1-48:15 - [i52]Sergei Kiselev, Andrey Kupavskii:
Rainbow matchings in k-partite hypergraphs. CoRR abs/2001.02181 (2020) - [i51]Andrey Kupavskii:
The VC-dimension of k-vertex d-polytopes. CoRR abs/2004.04841 (2020) - [i50]Peter Frankl, Andrey Kupavskii:
Almost intersecting families. CoRR abs/2004.08714 (2020) - [i49]Peter Frankl, Andrey Kupavskii:
Maximal degrees in subgraphs of Kneser graphs. CoRR abs/2004.08718 (2020) - [i48]Peter Frankl, Andrey Kupavskii:
Intersection theorems for (-1, 0, 1)-vectors. CoRR abs/2004.08721 (2020) - [i47]Andrey Kupavskii, Stefan Weltge:
Binary scalar products. CoRR abs/2008.07153 (2020) - [i46]Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
Intersection theorems for triangles. CoRR abs/2009.14560 (2020) - [i45]Sergei Kiselev, Andrey Kupavskii:
Trivial colors in colorings of Kneser graphs. CoRR abs/2012.14528 (2020)
2010 – 2019
- 2019
- [j31]Andrey Kupavskii, János Pach, István Tomon:
On the Size of K-Cross-Free Families. Comb. 39(1): 153-164 (2019) - [j30]Peter Frankl, Andrey Kupavskii:
Incompatible Intersection Properties. Comb. 39(6): 1255-1266 (2019) - [j29]Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. 28(2): 280-286 (2019) - [j28]Ferdinand Ihringer, Andrey Kupavskii:
Regular intersecting families. Discret. Appl. Math. 270: 142-152 (2019) - [j27]Peter Frankl, Andrey Kupavskii:
Families of sets with no matchings of sizes 3 and 4. Eur. J. Comb. 75: 123-135 (2019) - [j26]Peter Frankl, Andrey Kupavskii:
Two problems on matchings in set families - In the footsteps of Erdős and Kleitman. J. Comb. Theory B 138: 286-313 (2019) - [j25]Andrey Kupavskii:
Degree versions of theorems on intersecting families via stability. J. Comb. Theory A 168: 272-287 (2019) - [j24]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: 81:1-81:8 (2019) - [c6]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. SoCG 2019: 38:1-38:13 - [i44]Peter Frankl, Andrey Kupavskii:
Simple juntas for shifted families. CoRR abs/1901.03816 (2019) - [i43]Peter Frankl, Andrey Kupavskii:
Beyond the Erdős Matching Conjecture. CoRR abs/1901.09278 (2019) - [i42]Peter Frankl, Andrey Kupavskii:
Sharp results concerning disjoint cross-intersecting families. CoRR abs/1905.08123 (2019) - 2018
- [j23]Andrey Kupavskii:
Random Kneser Graphs and Hypergraphs. Electron. J. Comb. 25(4): 4 (2018) - [j22]Peter Frankl, Andrey Kupavskii:
Counting Intersecting and Pairs of Cross-Intersecting Families. Comb. Probab. Comput. 27(1): 60-68 (2018) - [j21]Andrey Kupavskii, Dmitry A. Shabanov:
Colourings of Uniform Hypergraphs with Large Girth and Applications. Comb. Probab. Comput. 27(2): 245-273 (2018) - [j20]Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings with noncongruent triangles. Eur. J. Comb. 73: 72-80 (2018) - [j19]Andrey Kupavskii:
Diversity of uniform intersecting families. Eur. J. Comb. 74: 39-47 (2018) - [j18]Peter Frankl, Andrey Kupavskii:
Erdős-Ko-Rado theorem for {0, ±1}-vectors. J. Comb. Theory A 155: 157-179 (2018) - [j17]Andrey Kupavskii, Dmitriy Zakharov:
Regular bipartite graphs and intersecting families. J. Comb. Theory A 155: 180-189 (2018) - [j16]Peter Frankl, Andrey Kupavskii:
New inequalities for families without k pairwise disjoint members. J. Comb. Theory A 157: 427-434 (2018) - [j15]Andrey Kupavskii, Maksim Zhukovskii:
Short Monadic Second Order Sentences about Sparse Random Graphs. SIAM J. Discret. Math. 32(4): 2916-2940 (2018) - [c5]Andrey Kupavskii, Emo Welzl:
Lower Bounds for Searching Robots, some Faulty. PODC 2018: 447-453 - [i41]Peter Frankl, Andrey Kupavskii:
New inequalities for families without k pairwise disjoint members. CoRR abs/1804.03581 (2018) - [i40]Mónika Csikós, Andrey Kupavskii, Nabil H. Mustafa:
Optimal Bounds on the VC-dimension. CoRR abs/1807.07924 (2018) - [i39]Peter Frankl, Andrey Kupavskii:
Incompatible intersection properties. CoRR abs/1808.01229 (2018) - [i38]Andrey Kupavskii:
Degree versions of theorems on intersecting families via stability. CoRR abs/1810.00915 (2018) - [i37]Andrey Kupavskii:
Structure and properties of large intersecting families. CoRR abs/1810.00920 (2018) - [i36]Sergei Kiselev, Andrey Kupavskii:
Sharp bounds for the chromatic number of random Kneser graphs. CoRR abs/1810.01161 (2018) - [i35]Peter Frankl, Andrey Kupavskii:
Diversity. CoRR abs/1811.01111 (2018) - [i34]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. CoRR abs/1812.04911 (2018) - 2017
- [j14]Andrey B. Kupavskii, Alexandr Polyanskii:
Proof of Schur's Conjecture in ℝ D. Comb. 37(6): 1181-1205 (2017) - [j13]Peter Frankl, Andrey Kupavskii:
Uniform s-Cross-Intersecting Families. Comb. Probab. Comput. 26(4): 517-524 (2017) - [j12]Peter Frankl, Andrey Kupavskii:
A size-sensitive inequality for cross-intersecting families. Eur. J. Comb. 62: 263-271 (2017) - [j11]Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel:
Embedding graphs in Euclidean space. Electron. Notes Discret. Math. 61: 475-481 (2017) - [j10]Peter Frankl, Andrey Kupavskii:
Families with no matchings of size s. Electron. Notes Discret. Math. 61: 483-489 (2017) - [j9]Peter Frankl, Andrey Kupavskii:
Families with no s pairwise disjoint sets. J. Lond. Math. Soc. 95(3): 875-894 (2017) - [j8]Andrey Kupavskii, János Pach:
From Tarski's Plank Problem to Simultaneous Approximation. Am. Math. Mon. 124(6): 494-505 (2017) - [i33]Peter Frankl, Andrey Kupavskii:
Families of sets with no matchings of sizes 3 and 4. CoRR abs/1701.04107 (2017) - [i32]Peter Frankl, Andrey Kupavskii:
Counting intersecting and pairs of cross-intersecting families. CoRR abs/1701.04110 (2017) - [i31]Andrey Kupavskii, János Pach, Gábor Tardos:
Controlling Lipschitz functions. CoRR abs/1704.03062 (2017) - [i30]Peter Frankl, Andrey Kupavskii:
Families of vectors without antipodal pairs. CoRR abs/1705.07216 (2017) - [i29]Peter Frankl, Andrey Kupavskii:
Partition-free families of sets. CoRR abs/1706.00215 (2017) - [i28]Andrey Kupavskii, Emo Welzl:
Lower Bounds for Searching Robots, some Faulty. CoRR abs/1707.05077 (2017) - [i27]Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the size of an almost-equidistant set in Euclidean space. CoRR abs/1708.01590 (2017) - [i26]Andrey Kupavskii:
Diversity of uniform intersecting families. CoRR abs/1709.02829 (2017) - [i25]Ferdinand Ihringer, Andrey Kupavskii:
Regular Intersecting Families. CoRR abs/1709.10462 (2017) - [i24]Andrey Kupavskii:
Structure and properties of large intersecting families. CoRR abs/1710.02440 (2017) - [i23]Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings with noncongruent triangles. CoRR abs/1711.04504 (2017) - [i22]Andrey Kupavskii, Nikita Zhivotovskiy:
When are epsilon-nets small? CoRR abs/1711.10414 (2017) - [i21]Andrey Kupavskii, János Pach, Gábor Tardos:
Tilings of the plane with unit area triangles of bounded diameter. CoRR abs/1712.03118 (2017) - 2016
- [j7]Andrey Kupavskii:
The number of double-normals in space. Discret. Comput. Geom. 56(3): 711-726 (2016) - [j6]Andrey Kupavskii:
On random subgraphs of Kneser and Schrijver graphs. J. Comb. Theory A 141: 8-15 (2016) - [c4]Andrey Kupavskii, Nabil H. Mustafa, János Pach:
New Lower Bounds for epsilon-Nets. SoCG 2016: 54:1-54:16 - [i20]Peter Frankl, Andrey Kupavskii:
A size-sensitive inequality for cross-intersecting families. CoRR abs/1603.00936 (2016) - [i19]Peter Frankl, Andrey Kupavskii:
Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families. CoRR abs/1603.00938 (2016) - [i18]Peter Frankl, Andrey Kupavskii:
Families with no s pairwise disjoint sets. CoRR abs/1607.06122 (2016) - [i17]Peter Frankl, Andrey Kupavskii:
Two problems of P. Erdős on matchings in set families. CoRR abs/1607.06126 (2016) - [i16]Andrey Kupavskii, Dmitriy Zakharov:
Regular bipartite graphs and intersecting families. CoRR abs/1611.03129 (2016) - [i15]Peter Frankl, Andrey Kupavskii:
Uniform s-cross-intersecting families. CoRR abs/1611.07258 (2016) - [i14]Andrey Kupavskii, Maksim Zhukovskii:
Short monadic second order sentences about sparse random graphs. CoRR abs/1611.07260 (2016) - [i13]Andrey Kupavskii:
Random Kneser graphs and hypergraphs. CoRR abs/1612.03868 (2016) - 2015
- [c3]Andrei Kupavskii, János Pach:
Simultaneous Approximation of Polynomials. JCDCGG 2015: 193-203 - [i12]Andrey B. Kupavskii:
On random subgraphs of Kneser and Schrijver graphs. CoRR abs/1502.00699 (2015) - [i11]Peter Frankl, Andrey Kupavskii:
Erdős-Ko-Rado theorem for {0, ±: 1}-vectors. CoRR abs/1510.03912 (2015) - [i10]Andrey B. Kupavskii, János Pach:
From Tarski's plank problem to simultaneous approximation. CoRR abs/1511.08111 (2015) - 2014
- [j5]Andrey Kupavskii:
Diameter Graphs in ℝ4. Discret. Comput. Geom. 51(4): 842-858 (2014) - [j4]Noga Alon, Andrey Kupavskii:
Two notions of unit distance graphs. J. Comb. Theory A 125: 1-17 (2014) - [i9]