15 citations · 86 across the 50 of their papers we have counts for
6 papers · 1 filter
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…
Short Proof of Erd\H os Conjecture for Triple Systems
Peter Frankl, Vojtech Rödl, Andrzej Ruciński
In 1965 Erd\H os conjectured that for all , and , an -vertex -uniform hypergraph $\F$ with $ν(\F)=s$ cannot have more than \newline $\max\{\binom{…
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…
Intersection theorems for -vectors and -cross-intersecting families
Peter Frankl, Andrey Kupavskii
In this paper we study two directions of extending the classical Erd\H os-Ko-Rado theorem which states that any family of -element subsets of the set in w…
A size-sensitive inequality for cross-intersecting families
Peter Frankl, Andrey Kupavskii
Two families and of -subsets of an -set are called cross-intersecting if for all . Strength…