8 citations · 9 across the 7 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DM2021
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…
math.CO2021
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…
math.CO2021
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…