An Erdős-Ko-Rado Theorem for Multisets release_k4dcwq6aiva3rjviwucpnmbcxy

by Karen Meagher, Alison Purdy

Published in Electronic Journal of Combinatorics by The Electronic Journal of Combinatorics.

2011   P220

Abstract

Let $k$ and $m$ be positive integers. A collection of $k$-multisets from $\{1,\dots, 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.
In application/xml+jats format

Archived Files and Locations

application/pdf  107.1 kB
file_egw76wt6wrdsfhvwrr45gsroxe
www.combinatorics.org (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2011-11-21
DOI  10.37236/707
Journal Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  1077-8926
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 47a9e2d1-ef2e-4409-af33-32dbf6b73ea1
API URL: JSON