3 papers
math.CO2020
VC-saturated set systems
Nóra Frankl, Sergei Kiselev, Andrey Kupavskii +1
The well-known Sauer lemma states that a family of VC-dimension at most has size at most . We obtain both random and ex…
math.CO2020
Rainbow matchings in -partite hypergraphs
Sergei Kiselev, Andrey Kupavskii
In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families of…
math.CO2018
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
Jozsef Balogh, Danila Cherkashin, Sergei Kiselev
We suggest a new method on coloring generalized Kneser graphs based on hypergraphs with high discrepancy and small number of edges. The main result is providing a proper coloring o…