A simple proof of the Hilton-Milner theorem
From MaRDI portal
Publication:2420488
DOI10.2140/moscow.2019.8.97zbMath1414.05289OpenAlexW2946909874WikidataQ127819259 ScholiaQ127819259MaRDI QIDQ2420488
Publication date: 6 June 2019
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.moscow/1559095384
Related Items (7)
A product version of the Hilton-Milner theorem ⋮ Uniform intersecting families with large covering number ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems ⋮ Intersecting families, signed sets, and injection ⋮ Old and new applications of Katona's circle ⋮ On strengthenings of the intersecting shadow theorem
Cites Work
- Non-trivial intersecting families
- A generalization of a theorem of Kruskal
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Some best possible inequalities concerning cross-intersecting families
- Regular bipartite graphs and intersecting families
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Unnamed Item
- Unnamed Item
This page was built for publication: A simple proof of the Hilton-Milner theorem
