A new generalization of the Erdo¨s-Ko-Rado theorem
Journal of Combinatorial Theory Series A
The exact bound in the Erdo¨s—Ko—Rado theorem for cross-intersecting fami
Journal of Combinatorial Theory Series A
Multiply-intersecting families
Journal of Combinatorial Theory Series A
The complete intersection theorem for systems of finite sets
European Journal of Combinatorics
EKR type inequalities for 4-wise intersecting families
Journal of Combinatorial Theory Series A
The maximum size of 3-wise t-intersecting families
European Journal of Combinatorics
Multiply-intersecting families revisited
Journal of Combinatorial Theory Series B
Brace-Daykin type inequalities for intersecting families
European Journal of Combinatorics
Intersecting families are essentially contained in juntas
Combinatorics, Probability and Computing
Freiman's theorem in finite fields via extremal set theory
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
On cross t-intersecting families of sets
Journal of Combinatorial Theory Series A
Set systems without a simplex or a cluster
Combinatorica
The eigenvalue method for cross t-intersecting families
Journal of Algebraic Combinatorics: An International Journal
Hi-index | 0.00 |
Let F"1,...,F"r@?([n]k) be r-cross t-intersecting, that is, |F"1@?...@?F"r|=t holds for all F"1@?F"1,...,F"r@?F"r. We prove that for every p,@m@?(0,1) there exists r"0 such that for all rr"0, all t with 1=n"0 and |k/n-p|