Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs. - József Balogh; Danila D. Cherkashin; Sergei Kiselev (Eur. J. Comb., 2019)

Rainbow matchings in k-partite hypergraphs. - Sergei Kiselev; Andrey Kupavskii (CoRR, 2020)

On Anti-stochastic Properties of Unlabeled Graphs. - Sergei Kiselev; Andrey Kupavskii; Oleg Verbitsky 001; Maksim Zhukovskii (WG, 2022)

On the maximum number of distinct intersections in an intersecting family. - Peter Frankl; Sergei Kiselev; Andrey Kupavskii (Discret. Math., 2022)

VC-saturated set systems. - Nóra Frankl; Sergei Kiselev; Andrey Kupavskii; Balázs Patkós (Eur. J. Comb., 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)

Sharp bounds for the chromatic number of random Kneser graphs. - Sergei Kiselev; Andrey Kupavskii (J. Comb. Theory B, 2022)

Best possible bounds on the number of distinct differences in intersecting families. - Peter Frankl; Sergei Kiselev; Andrey Kupavskii (Eur. J. Comb., 2023)

On Isomorphism-Invariant Antistochastic Properties of Random Graphs. - Sergei Kiselev; Andrey Kupavskii; Oleg Verbitsky 001; Maksim Zhukovskii (SIAM J. Discret. Math., 2024)

Trivial colors in colorings of Kneser graphs. - Sergei Kiselev; Andrey Kupavskii (Discret. Math., 2024)