A Common Generalization of the Theorems of Erdős-Ko-Rado and Hilton-Milner

preprint2013arXivOpen access

Abstract

Let mm, nn, and kk be integers satisfying 0<k≤n<2k≤m0 < k \leq n < 2k \leq m. A family of sets F\mathcal{F} is called an (m,n,k)(m,n,k)-intersecting family if ([n]k)⊆F⊆([m]k)\binom{[n]}{k} \subseteq \mathcal{F} \subseteq \binom{[m]}{k} and any pair of members of F\mathcal{F} have nonempty intersection. Maximum (m,k,k)(m,k,k)- and (m,k+1,k)(m,k+1,k)-intersecting families are determined by the theorems of Erdős-Ko-Rado and Hilton-Milner, respectively. We determine the maximum families for the cases n=2k−1,2k−2,2k−3n = 2k-1, 2k-2, 2k-3, and mm sufficiently large.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.