Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
From MaRDI portal
Publication:2694281
DOI10.2140/moscow.2023.12.89OpenAlexW4361284582MaRDI QIDQ2694281
Nguyen Trong Tuan, Nguyen Anh Thi
Publication date: 3 April 2023
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/moscow.2023.12.89
Cites Work
- Maximum hitting for \(n\) sufficiently large
- Non-trivial intersecting families
- A generalization of a theorem of Kruskal
- 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
- Erdős-Ko-Rado from Kruskal-Katona
- A simple proof of the Hilton-Milner theorem
- A simple proof of the Erdős-Chao Ko-Rado theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems