Sergei Kiselev

According to our database, Sergei Kiselev authored at least 10 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Trivial colors in colorings of Kneser graphs.

Sergei Kiselev, Andrey Kupavskii

Discret. Math., April, 2024

On Isomorphism-Invariant Antistochastic Properties of Random Graphs.

Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii

SIAM J. Discret. Math., 2024

2023

Best possible bounds on the number of distinct differences in intersecting families.

Peter Frankl, Sergei Kiselev, Andrey Kupavskii

Eur. J. Comb., 2023

2022

Sharp bounds for the chromatic number of random Kneser graphs.

Sergei Kiselev, Andrey Kupavskii

J. Comb. Theory B, 2022

Dynamic optimisation of elevators using biometric identification systems.

Eugeniu Cozac, Dmitry Gura, Alexey Bityutskiy, Sergei Kiselev, Anastasia Repeva

Int. J. Simul. Process. Model., 2022

VC-saturated set systems.

Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós

Eur. J. Comb., 2022

On the maximum number of distinct intersections in an intersecting family.

Peter Frankl, Sergei Kiselev, Andrey Kupavskii

Discret. Math., 2022

On Anti-stochastic Properties of Unlabeled Graphs.

Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2020

Rainbow matchings in k-partite hypergraphs.

Sergei Kiselev, Andrey Kupavskii

CoRR, 2020

2019

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs.

József Balogh, Danila D. Cherkashin, Sergei Kiselev

Eur. J. Comb., 2019