An Erdős-Ko-Rado theorem for multisets

Details An Erdős-Ko-Rado theorem for multisets An Erdős-Ko-Rado theorem for multisets

2011-11-18

arxiv.org/abs/1111.4493v1

Electron. J. Combin. 18 (2011), no.1, Paper 220, 8 pp

Mathematics

Combinatorics

8 pages

Scientific paper

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 \geq k+1$, the size of the largest such collection is $\binom{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 \leq k$ is also given.

Affiliated with

Also associated with

No associations

Rating

An Erdős-Ko-Rado theorem for multisets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Erdős-Ko-Rado theorem for multisets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Erdős-Ko-Rado theorem for multisets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514207