Intersection theorems for multisets

DOI10.1016/j.ejc.2015.09.006zbMath1409.05205arXiv1504.06657OpenAlexW1817870969MaRDI QIDQ896069

Alison Purdy, Karen Meagher

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)

Cites Work

• Improved bounds for Erdős' matching conjecture
• On matchings in hypergraphs
• The complete intersection theorem for systems of finite sets
• Extremal problems concerning Kneser-graphs
• The complete nontrivial-intersection theorem for systems of finite sets
• 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
• The Size of a Hypergraph and its Matching Number
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• An Erdős-Ko-Rado theorem for multisets
• On intersecting families of finite sets

This page was built for publication: Intersection theorems for multisets