S. Kiselev

activity

20182021

k

-partite hypergraphs

8 citations · 9 across the 7 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Trivial colors in colorings of Kneser graphs

Sergei Kiselev, Andrey Kupavskii

We show that any proper coloring of a Kneser graph $K G_{n, k}$ with $n - 2 k + 2$ colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), pro…

math.CO2020

VC-saturated set systems

Nóra Frankl, Sergei Kiselev, Andrey Kupavskii +1

The well-known Sauer lemma states that a family $F \subseteq 2^{[n]}$ of VC-dimension at most $d$ has size at most $\sum_{i = 0}^{d} (i n)$ . We obtain both random and ex…

math.CO2020★ 8 cited

Rainbow matchings in $k$ -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 $F_{1}, \dots, F_{s}$ of…

Trivial colors in colorings of Kneser graphs

VC-saturated set systems

Rainbow matchings in k-partite hypergraphs

Rainbow matchings in $k$ -partite hypergraphs