Erdős Matching Conjecture for almost perfect matchings
share
In 1965 Erdős asked, what is the largest size of a family of k-elements subsets of an n-element set that does not have a matching of size s+1? In this note, we improve upon a recent result of Frankl and resolve this problem for s>101k^3 and (s+1)k≤ n<(s+1)(k+1/100k).
READ FULL TEXT