Multiply-intersecting families
Journal of Combinatorial Theory Series A
The complete nontrivial-intersection theorem for systems of finite sets
Journal of Combinatorial Theory Series A
The complete intersection theorem for systems of finite sets
European Journal of Combinatorics
Regular Article: The Diametric Theorem in Hamming Spaces驴Optimal Anticodes
Advances in Applied Mathematics
Weighted 3-wise 2-intersecting families
Journal of Combinatorial Theory Series A
Random walks and multiply intersecting families
Journal of Combinatorial Theory Series A
Weighted Non-Trivial Multiply Intersecting Families
Combinatorica
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
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 |
Motivated by the Frankl's results in [P. Frankl, Multiply-intersecting families, J. Combin. Theory B 53 (1991) 195-234], we consider some problems concerning the maximum size of multiply-intersecting families with additional conditions. Among other results, we show the following version of the Erdos-Ko-Rado theorem: for all r=5 and 1=n"0 and |kn-12|