Intersection theorems for multisets

DOI10.1016/J.EJC.2015.09.006MaRDI QIDQ896069zbMATH OpenOpenAlexFDO

Authors K. Meagher, Alison Purdy

Publication date 11 December 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.06657

zbMATH Keywords

Hilton-Milner theorem

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $1,\mathrm{...},m$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting and $t$-intersecting $k$-set systems to prove new results for intersecting and $t$-intersecting families of $k$-multisets. These results include a multiset version of the Hilton-Milner theorem and a theorem giving the size and structure of the largest $t$-intersecting family of $k$-multisets of an $m$-set when $mleq2k-t$.

Recommendations

• An Erdős-Ko-Rado theorem for multisets
• The intersection theorem for direct products
• An analogue of the Erdős-Ko-Rado theorem for multisets
• Intersecting families in symmetric unions of direct products of set families
• Non-trivial intersecting families

Cites work

• A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
• A generalization of the Erdős-Ko-Rado theorem on finite set systems
• An Erdős-Ko-Rado theorem for multisets
• Extremal problems concerning Kneser-graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Improved bounds for Erdős' matching conjecture
• On intersecting families of finite sets
• On matchings in hypergraphs
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The complete intersection theorem for systems of finite sets
• The complete nontrivial-intersection theorem for systems of finite sets
• The size of a hypergraph and its matching number

Cited in

(9)

• Multiset systems: a creative review
• An Erdős-Ko-Rado theorem for multisets
• Intersection properties of subsets of integers
• Sum-intersective sets
• On the independence number of a variant of the divisor graph
• Hilton-Milner theorem for k-multisets
• Intersecting families of polynomials over finite fields
• An analogue of the Erdős-Ko-Rado theorem for multisets
• An intersection theorem for weighted sets

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)