Подписаться
Andrey Kupavskii
Andrey Kupavskii
Moscow Institute of Physics and Technology
Подтвержден адрес электронной почты в домене mipt.ru - Главная страница
Название
Процитировано
Процитировано
Год
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
2342012
The Erdős matching conjecture and concentration inequalities
P Frankl, A Kupavskii
Journal of Combinatorial Theory, Series B 157, 366-400, 2022
88*2022
Regular bipartite graphs and intersecting families
A Kupavskii, D Zakharov
Journal of Combinatorial Theory, Series A 155, 180-189, 2018
592018
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
582013
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
56*2019
On the chromatic number of Rn with an arbitrary norm
A Kupavskiy
Discrete mathematics 311 (6), 437-440, 2011
452011
On the colouring of spheres embedded in R^n
AB Kupavskii
Sbornik: Mathematics 202 (6), 859, 2011
40*2011
Erdős–Ko–Rado theorem for {0,±1}-vectors
P Frankl, A Kupavskii
Journal of Combinatorial Theory, Series A 155, 157-179, 2018
372018
On random subgraphs of Kneser and Schrijver graphs
A Kupavskii
Journal of Combinatorial Theory, Series A 141, 8-15, 2016
37*2016
Two notions of unit distance graphs
N Alon, A Kupavskii
Journal of Combinatorial Theory, Series A 125, 1-17, 2014
352014
Diversity of uniform intersecting families
A Kupavskii
European Journal of Combinatorics 74, 39-47, 2018
342018
A size-sensitive inequality for cross-intersecting families
P Frankl, A Kupavskii
European Journal of Combinatorics 62, 263-271, 2017
282017
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
262020
Lower bounds for searching robots, some faulty
A Kupavskii, E Welzl
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
252018
Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
AB Kupavskii
Izvestiya: Mathematics 78 (1), 59, 2014
24*2014
Degree versions of theorems on intersecting families via stability
A Kupavskii
Journal of Combinatorial Theory, Series A 168, 272-287, 2019
232019
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
232019
Families of sets with no matchings of sizes 3 and 4
P Frankl, A Kupavskii
European Journal of Combinatorics 75, 123-135, 2019
232019
Counting intersecting and pairs of cross-intersecting families
P Frankl, A Kupavskii
Combinatorics, Probability and Computing 27 (1), 60-68, 2018
232018
Sharp bounds for the chromatic number of random Kneser graphs
S Kiselev, A Kupavskii
Journal of Combinatorial Theory, Series B 157, 96-122, 2022
22*2022
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20