There are many generalizations of the Erdos-Ko-Rado theorem. Here the new results (and problems) concern families of t-intersecting k-element multisets of an n-set. We point out connections to coding theory and geometry. We verify the conjecture that for n≥. t(. k-. t). +. 2 such a family can have at most (n+k-t-1k-t) members.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics