15 citations · 149 across the 60 of their papers we have counts for
8 papers · 1 filter
Random Kneser graphs and hypergraphs
Andrey Kupavskii
The Kneser graph is the graph whose vertices are the -element subsets of with two vertices adjacent if and only if the corresponding sets are disjoint. A famou…
Short monadic second order sentences about sparse random graphs
Andrey Kupavskii, Maksim Zhukovskii
In this paper, we study zero-one laws for the Erdős--Rényi random graph model in the case when for . For a given class of logical sentences…
Uniform s-cross-intersecting families
Peter Frankl, Andrey Kupavskii
In this paper we study a question related to the classical Erdős-Ko-Rado theorem, which states that any family of -element subsets of the set in which any…
Regular bipartite graphs and intersecting families
Andrey Kupavskii, Dmitriy Zakharov
In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erd\H os--Ko--Rado theorem, the Hi…
Two problems on matchings in set families - in the footsteps of Erdős and Kleitman
Peter Frankl, Andrey Kupavskii
The families are called -dependent if there are no pairwise disjoint satisfyi…
Families with no pairwise disjoint sets
Peter Frankl, Andrey Kupavskii
For integers let denote the maximum of where is a family of subsets of an -element set and contains no pairw…