Követés
Sergei Kiselev
Sergei Kiselev
E-mail megerősítve itt: phystech.edu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
J Balogh, D Cherkashin, S Kiselev
European Journal of Combinatorics 79, 228-236, 2019
412019
On the chromatic number of a random subgraph of the Kneser graph.
S Kiselev, A Raigorodskii
Doklady Mathematics 96 (2), 2017
20*2017
Sharp bounds for the chromatic number of random Kneser graphs
S Kiselev, A Kupavskii
arXiv preprint arXiv:1810.01161, 2018
172018
Independence Numbers of Random Subgraphs of Some Distance Graph
NM Derevyanko, SG Kiselev
Problems of Information Transmission 53 (4), 307-318, 2017
12*2017
VC-saturated set systems
N Frankl, S Kiselev, A Kupavskii, B Patkós
European Journal of Combinatorics 104, 103528, 2022
72022
Rainbow matchings in ‐partite hypergraphs
S Kiselev, A Kupavskii
Bulletin of the London Mathematical Society 53 (2), 360-369, 2021
72021
Independence numbers of Johnson-type graphs
D Cherkashin, S Kiselev
arXiv preprint arXiv:1907.06752, 2019
62019
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
52023
On the maximum number of distinct intersections in an intersecting family
P Frankl, S Kiselev, A Kupavskii
Discrete Mathematics 345 (4), 112757, 2022
52022
Trivial colors in colorings of Kneser graphs
S Kiselev, A Kupavskii
arXiv preprint arXiv:2012.14528, 2020
32020
On anti-stochastic properties of unlabeled graphs
S Kiselev, A Kupavskii, O Verbitsky, M Zhukovskii
International Workshop on Graph-Theoretic Concepts in Computer Science, 300-312, 2022
2022
Minimum Clique-Free Subgraphs of Kneser Graphs
SV Vahrushev, ME Zhukovskii, SG Kiselev, AY Skorkin
Doklady Mathematics 102 (3), 472-473, 2020
2020
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–12