Intersection theorems for multisets
From MaRDI portal
Publication:896069
DOI10.1016/J.EJC.2015.09.006zbMATH Open1409.05205arXiv1504.06657OpenAlexW1817870969MaRDI QIDQ896069FDOQ896069
Authors: K. Meagher, Alison Purdy
Publication date: 11 December 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: Let , and be positive integers. A -multiset of is a collection of integers from the set in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting and -intersecting -set systems to prove new results for intersecting and -intersecting families of -multisets. These results include a multiset version of the Hilton-Milner theorem and a theorem giving the size and structure of the largest -intersecting family of -multisets of an -set when .
Full work available at URL: https://arxiv.org/abs/1504.06657
Recommendations
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete nontrivial-intersection theorem for systems of finite sets
- The complete intersection theorem for systems of finite sets
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
- An Erdős-Ko-Rado theorem for multisets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The size of a hypergraph and its matching number
- Extremal problems concerning Kneser-graphs
- Improved bounds for Erdős' matching conjecture
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- On matchings in hypergraphs
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- On intersecting families of finite sets
Cited In (6)
This page was built for publication: Intersection theorems for multisets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896069)