8 citations · 9 across the 7 of their papers we have counts for
9 papers
On anti-stochastic properties of unlabeled graphs
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky +1
We study vulnerability of a uniformly distributed random graph to an attack by an adversary who aims for a global change of the distribution while being able to make only a local c…
On the maximum number of distinct intersections in an intersecting family
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
For we consider intersecting families consisting of -subsets of . Let denote the family of all distinc…
Best possible bounds on the number of distinct differences in intersecting families
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
For a family , let stand for the family of all sets that can be expressed as , where . A family i…
Trivial colors in colorings of Kneser graphs
Sergei Kiselev, Andrey Kupavskii
We show that any proper coloring of a Kneser graph with colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), pro…
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…
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…