{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:06Z","timestamp":1753893846931,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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 &gt; 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.<\/jats:p>","DOI":"10.37236\/707","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:39:37Z","timestamp":1578695977000},"source":"Crossref","is-referenced-by-count":10,"title":["An Erd\u0151s-Ko-Rado Theorem for Multisets"],"prefix":"10.37236","volume":"18","author":[{"given":"Karen","family":"Meagher","sequence":"first","affiliation":[]},{"given":"Alison","family":"Purdy","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2011,11,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p220\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p220\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T17:59:01Z","timestamp":1579283941000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/707","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,11,21]]},"article-number":"P220"}}