Подписаться
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
2332012
The Erdős matching conjecture and concentration inequalities
P Frankl, A Kupavskii
Journal of Combinatorial Theory, Series B 157, 366-400, 2022
69*2022
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
542013
Regular bipartite graphs and intersecting families
A Kupavskii, D Zakharov
Journal of Combinatorial Theory, Series A 155, 180-189, 2018
492018
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
47*2019
On the chromatic number of Rn with an arbitrary norm
A Kupavskiy
Discrete mathematics 311 (6), 437-440, 2011
442011
On the colouring of spheres embedded in R^n
AB Kupavskii
Sbornik: Mathematics 202 (6), 859, 2011
39*2011
On random subgraphs of Kneser and Schrijver graphs
A Kupavskii
Journal of Combinatorial Theory, Series A 141, 8-15, 2016
35*2016
Two notions of unit distance graphs
N Alon, A Kupavskii
Journal of Combinatorial Theory, Series A 125, 1-17, 2014
342014
Erdős–Ko–Rado theorem for {0,±1}-vectors
P Frankl, A Kupavskii
Journal of Combinatorial Theory, Series A 155, 157-179, 2018
312018
Diversity of uniform intersecting families
A Kupavskii
European Journal of Combinatorics 74, 39-47, 2018
252018
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
222020
A size-sensitive inequality for cross-intersecting families
P Frankl, A Kupavskii
European Journal of Combinatorics 62, 263-271, 2017
222017
Families of sets with no matchings of sizes 3 and 4
P Frankl, A Kupavskii
European Journal of Combinatorics 75, 123-135, 2019
212019
Random Kneser graphs and hypergraphs
A Kupavskii
arXiv preprint arXiv:1612.03868, 2016
212016
Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
AB Kupavskii
Izvestiya: Mathematics 78 (1), 59, 2014
21*2014
Tight lower bounds on the VC-dimension of geometric set systems
M Csikós, NH Mustafa, A Kupavskii
The Journal of Machine Learning Research 20 (1), 2991-2998, 2019
202019
Families with no pairwise disjoint sets
P Frankl, A Kupavskii
Journal of the London Mathematical Society 95 (3), 875-894, 2017
202017
Distance graphs with large chromatic number and arbitrary girth
A Kupavskii
arXiv preprint arXiv:1306.3921, 2013
202013
On the chromatic number of ℝ9
AB Kupavskii, AM Raigorodskii
Journal of Mathematical Sciences 163, 720-731, 2009
20*2009
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20