Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs J Balogh, D Cherkashin, S Kiselev
European Journal of Combinatorics 79, 228-236, 2019
50 2019 Sharp bounds for the chromatic number of random Kneser graphs S Kiselev, A Kupavskii
Journal of Combinatorial Theory, Series B 157, 96-122, 2022
21 * 2022 On the chromatic number of a random subgraph of the Kneser graph. S Kiselev, A Raigorodskii
Doklady Mathematics 96 (2), 2017
20 * 2017 Independence numbers of random subgraphs of some distance graph NM Derevyanko, SG Kiselev
Problems of Information Transmission 53, 307-318, 2017
14 * 2017 VC-saturated set systems N Frankl, S Kiselev, A Kupavskii, B Patkós
European Journal of Combinatorics 104, 103528, 2022
11 2022 Rainbow matchings in S Kiselev, A Kupavskii
Bulletin of the London Mathematical Society 53 (2), 360-369, 2021
10 2021 Independence numbers of Johnson-type graphs D Cherkashin, S Kiselev
arXiv preprint arXiv:1907.06752, 2019
7 2019 Best possible bounds on the number of distinct differences in intersecting families P Frankl, S Kiselev, A Kupavskii
European Journal of Combinatorics 107, 103601, 2023
6 2023 On the maximum number of distinct intersections in an intersecting family P Frankl, S Kiselev, A Kupavskii
Discrete Mathematics 345 (4), 112757, 2022
6 2022 Trivial colors in colorings of Kneser graphs S Kiselev, A Kupavskii
arXiv preprint arXiv:2012.14528, 2020
3 2020 On anti-stochastic properties of unlabeled graphs S Kiselev, A Kupavskii, O Verbitsky, M Zhukovskii
Graph-Theoretic Concepts in Computer Science: 48th International Workshop …, 2022
2022 Minimum clique-free subgraphs of Kneser graphs SV Vahrushev, ME Zhukovskii, SG Kiselev, AY Skorkin
Doklady Mathematics 102, 472-473, 2020
2020 
Andrey KupavskiiMoscow Institute of Physics and TechnologyПодтвержден адрес электронной почты в домене mipt.ru
