Maximal intersecting families revisited
Yongjiang Wu, Yongtao Li, Lihua Feng, Jiuqiang Liu, Guihai Yu

TL;DR
This paper extends stability results for intersecting families, generalizes previous theorems, and provides new, simpler proofs for classical results like the Hilton--Milner theorem, enhancing understanding of combinatorial set systems.
Contribution
It introduces a new stability variant that unifies and extends prior results, and offers more straightforward proofs of key theorems in intersecting family theory.
Findings
Established a generalized stability result for cross-intersecting families.
Provided simplified proofs for Hilton--Milner, Han--Kohayakawa, and Huang--Peng theorems.
Demonstrated applications of cross-intersecting family results to classical stability theorems.
Abstract
The well-known Erd\H{o}s--Ko--Rado theorem states that for , every intersecting family of -sets of has at most sets, and the extremal family consists of all -sets containing a fixed element (called a full star). The Hilton--Milner theorem provides a stability result by determining the maximum size of a uniform intersecting family that is not a subfamily of a full star. The further stabilities were studied by Han and Kohayakawa (2017) and Huang and Peng (2024). Two families and are called cross-intersecting if for every and , the intersection is non-empty. Let and be integers. Frankl (2016) proved that if and are cross-intersecting families, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems
