Follow
Andrey Kupavskii
Andrey Kupavskii
Moscow Institute of Physics and Technology, Department of Discrete Mathematics
Verified email at mipt.ru - Homepage
Title
Cited by
Cited by
Year
Prediction of retweet cascade size over time
A Kupavskii, L Ostroumova, A Umnov, S Usachev, P Serdyukov, G Gusev, ...
Proceedings of the 21st ACM international conference on Information and …, 2012
2042012
The Erd\H {o} s Matching Conjecture and concentration inequalities
P Frankl, A Kupavskii
arXiv preprint arXiv:1806.08855, 2018
472018
Predicting the audience size of a tweet
A Kupavskii, A Umnov, G Gusev, P Serdyukov
Proceedings of the International AAAI Conference on Web and Social Media 7 …, 2013
442013
Regular bipartite graphs and intersecting families
A Kupavskii, D Zakharov
Journal of Combinatorial Theory, Series A 155, 180-189, 2018
392018
On the chromatic number of Rn with an arbitrary norm
A Kupavskiy
Discrete mathematics 311 (6), 437-440, 2011
382011
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
36*2019
On random subgraphs of Kneser and Schrijver graphs
A Kupavskii
Journal of Combinatorial Theory, Series A 141, 8-15, 2016
36*2016
On the colouring of spheres embedded in R^n
AB Kupavskii
Sbornik: Mathematics 202 (6), 859, 2011
36*2011
Two notions of unit distance graphs
N Alon, A Kupavskii
Journal of Combinatorial Theory, Series A 125, 1-17, 2014
322014
Erdős–Ko–Rado theorem for {0,±1}-vectors
P Frankl, A Kupavskii
Journal of Combinatorial Theory, Series A 155, 157-179, 2018
262018
Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
AB Kupavskii
Izvestiya: Mathematics 78 (1), 59, 2014
22*2014
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
202020
Random Kneser graphs and hypergraphs
A Kupavskii
arXiv preprint arXiv:1612.03868, 2016
202016
Distance graphs with large chromatic number and arbitrary girth
A Kupavskii
arXiv preprint arXiv:1306.3921, 2013
202013
On the chromatic number of ℝ9.
A Kupavskii, A Raigorodskii
Journal of Mathematical Sciences 163 (6), 2009
19*2009
Families of sets with no matchings of sizes 3 and 4
P Frankl, A Kupavskii
European Journal of Combinatorics 75, 123-135, 2019
182019
Diversity of uniform intersecting families
A Kupavskii
European Journal of Combinatorics 74, 39-47, 2018
182018
The chromatic number of ℝ n with a set of forbidden distances
AB Kupavskii
Doklady Mathematics 82 (3), 963-966, 2010
18*2010
Degree versions of theorems on intersecting families via stability
A Kupavskii
Journal of Combinatorial Theory, Series A 168, 272-287, 2019
172019
Colourings of uniform hypergraphs with large girth and applications
A Kupavskii, D Shabanov
Combinatorics, Probability and Computing 27 (2), 245-273, 2018
172018
The system can't perform the operation now. Try again later.
Articles 1–20