Abstract
In 1965 Erdős asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size s+1? In this note, we improve upon a recent result of Frankl and resolve this problem for s>101k3 and (s+1)k⩽n<(s+1)(k+1100k).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
