Articles with public access mandates - Andrey KupavskiiLearn more
Available somewhere: 41
The Erdős matching conjecture and concentration inequalities
P Frankl, A Kupavskii
Journal of Combinatorial Theory, Series B 157, 366-400, 2022
Mandates: Swiss National Science Foundation, UK Engineering and Physical Sciences …
Two problems on matchings in set families–in the footsteps of Erdős and Kleitman
P Frankl, A Kupavskii
Journal of Combinatorial Theory, Series B 138, 286-313, 2019
Mandates: Agence Nationale de la Recherche
On random subgraphs of Kneser and Schrijver graphs
A Kupavskii
Journal of Combinatorial Theory, Series A 141, 8-15, 2016
Mandates: Swiss National Science Foundation
Two notions of unit distance graphs
N Alon, A Kupavskii
Journal of Combinatorial Theory, Series A 125, 1-17, 2014
Mandates: European Commission
Rainbow structures in locally bounded colorings of graphs
J Kim, D Kühn, A Kupavskii, D Osthus
Random Structures & Algorithms 56 (4), 1171-1204, 2020
Mandates: UK Engineering and Physical Sciences Research Council, Royal Society UK
A size-sensitive inequality for cross-intersecting families
P Frankl, A Kupavskii
European Journal of Combinatorics 62, 263-271, 2017
Mandates: Swiss National Science Foundation
Lower bounds for searching robots, some faulty
A Kupavskii, E Welzl
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
Mandates: Swiss National Science Foundation, UK Engineering and Physical Sciences …
Degree versions of theorems on intersecting families via stability
A Kupavskii
Journal of Combinatorial Theory, Series A 168, 272-287, 2019
Mandates: Swiss National Science Foundation
Tight lower bounds on the VC-dimension of geometric set systems
M Csikós, NH Mustafa, A Kupavskii
Journal of Machine Learning Research 20 (81), 1-8, 2019
Mandates: UK Engineering and Physical Sciences Research Council, Agence Nationale de …
Families with no pairwise disjoint sets
P Frankl, A Kupavskii
Journal of the London Mathematical Society 95 (3), 875-894, 2017
Mandates: Swiss National Science Foundation
Embedding graphs in Euclidean space
N Frankl, A Kupavskii, KJ Swanepoel
Journal of Combinatorial Theory, Series A 171, 105146, 2020
Mandates: Swiss National Science Foundation, UK Engineering and Physical Sciences …
New Lower Bounds for ϵ-nets
A Kupavskii, N Mustafa, J Pach
32nd Annual International Symposium on Computational Geometry (SoCG 2016), 54, 2016
Mandates: Swiss National Science Foundation
Max-norm Ramsey theory
N Frankl, A Kupavskii, A Sagdeev
European Journal of Combinatorics 118, 103918, 2024
Mandates: European Commission
Regular intersecting families
F Ihringer, A Kupavskii
Discrete Applied Mathematics 270, 142-152, 2019
Mandates: Research Foundation (Flanders), European Commission
Uniform s-cross-intersecting families
P Frankl, A Kupavskii
Combinatorics, Probability and Computing 26 (4), 517-524, 2017
Mandates: Swiss National Science Foundation
VC-saturated set systems
N Frankl, S Kiselev, A Kupavskii, B Patkós
European Journal of Combinatorics 104, 103528, 2022
Mandates: European Commission, National Office for Research, Development and …
Rainbow matchings in ‐partite hypergraphs
S Kiselev, A Kupavskii
Bulletin of the London Mathematical Society 53 (2), 360-369, 2021
Mandates: US National Science Foundation
Beyond the Erdős matching conjecture
P Frankl, A Kupavskii
European Journal of Combinatorics 95, 103338, 2021
Mandates: Swiss National Science Foundation
The extremal number of surfaces
A Kupavskii, A Polyanskii, I Tomon, D Zakharov
International Mathematics Research Notices 2022 (17), 13246-13271, 2022
Mandates: Swiss National Science Foundation
Incompatible intersection properties
P Frankl, A Kupavskii
Combinatorica 39 (6), 1255-1266, 2019
Mandates: UK Engineering and Physical Sciences Research Council
Publication and funding information is determined automatically by a computer program