Abstract
An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erdős–Ko–Rado theorem: when n>2k, every non-trivial intersecting family of k-subsets of [n] has at most (n−1k−1)−(n−k−1k−1)+1 members. One extremal family HMn,k consists of a k-set S and all k-subsets of [n] containing a fixed element x∉S and at least one element of S. We prove a degree version of the Hilton–Milner theorem: if n=Ω(k2) and F is a non-trivial intersecting family of k-subsets of [n], then δ(F)≤δ(HMn.k), where δ(F) denotes the minimum (vertex) degree of F. Our proof uses several fundamental results in extremal set theory, the concept of kernels, and a new variant of the Erdős–Ko–Rado theorem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.