An Erdo¨s-Ko-Rado Type theorem II
Acta Cybernetica
The complete intersection theorem for systems of finite sets
European Journal of Combinatorics
Weighted 3-wise 2-intersecting families
Journal of Combinatorial Theory Series A
Random walks and multiply intersecting families
Journal of Combinatorial Theory Series A
The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
European Journal of Combinatorics
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
A product version of the Erdős-Ko-Rado theorem
Journal of Combinatorial Theory Series A
The maximum size of intersecting and union families of sets
European Journal of Combinatorics
Hi-index | 0.00 |
Let 1==t holds for all A,B,C,D@?F. Then we have |F|=0 and all nn"0(@e). We apply this result to get EKR type inequalities for ''intersecting and union families'' and ''intersecting Sperner families.''