Abstract
The main result is the following. Let F be a family of k-subsets of an n-set, containing no s+1 pairwise disjoint edges. Then for n⩾(2s+1)k−s one has |F|⩽(nk)−(n−sk). This upper bound is the best possible and confirms a conjecture of Erdős dating back to 1965. The proof is surprisingly compact. It applies a generalization of Katonaʼs Intersection Shadow Theorem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
