Sergei Kiselev
Sergei Kiselev
Подтвержден адрес электронной почты в домене phystech.edu - Главная страница
Название
Процитировано
Процитировано
Год
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
J Balogh, D Cherkashin, S Kiselev
European Journal of Combinatorics 79, 228-236, 2019
332019
On the chromatic number of a random subgraph of the Kneser graph.
S Kiselev, A Raigorodskii
Doklady Mathematics 96 (2), 2017
17*2017
Sharp bounds for the chromatic number of random Kneser graphs
S Kiselev, A Kupavskii
arXiv preprint arXiv:1810.01161, 2018
112018
Independence Numbers of Random Subgraphs of Some Distance Graph
NM Derevyanko, SG Kiselev
Problems of Information Transmission 53 (4), 307-318, 2017
10*2017
Rainbow matchings in ‐partite hypergraphs
S Kiselev, A Kupavskii
Bulletin of the London Mathematical Society 53 (2), 360-369, 2021
52021
VC-saturated set systems
N Frankl, S Kiselev, A Kupavskii, B Patkós
arXiv preprint arXiv:2005.12545, 2020
52020
Independence numbers of Johnson-type graphs
D Cherkashin, S Kiselev
arXiv preprint arXiv:1907.06752, 2019
52019
Best possible bounds on the number of distinct differences in intersecting families
P Frankl, S Kiselev, A Kupavskii
arXiv preprint arXiv:2106.05355, 2021
22021
On the maximum number of distinct intersections in an intersecting family
P Frankl, S Kiselev, A Kupavskii
Discrete Mathematics 345 (4), 112757, 2022
12022
Trivial colors in colorings of Kneser graphs
S Kiselev, A Kupavskii
arXiv preprint arXiv:2012.14528, 2020
12020
On anti-stochastic properties of unlabeled graphs
S Kiselev, A Kupavskii, O Verbitsky, M Zhukovskii
arXiv preprint arXiv:2112.04395, 2021
2021
Best possible bounds on the number of distinct differences in intersecting families
A Kupavskii, P Frankl, S Kiselev
2021
Minimum Clique-Free Subgraphs of Kneser Graphs
SV Vahrushev, ME Zhukovskii, SG Kiselev, AY Skorkin
Doklady Mathematics 102 (3), 472-473, 2020
2020
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–13