An Erdos-Ko-Rado theorem for multisets

作者：Meagher Karen^*; Purdy Alison

来源：Electronic Journal of Combinatorics, 2011, 18(1): P220.

Let k and m be positive integers. A collection of k-multisets from {1, ... ,m} is intersecting if every pair of multisets from the collection is intersecting. We prove that for m >= k + 1, the size of the largest such collection is ((m+k-2)(k-1)) and that when m > k + 1, only a collection of all the k-multisets containing a fixed element will attain this bound. The size and structure of the largest intersecting collection of k-multisets for m <= k is also given.

• 出版日期2011-11-21