Erdős Matching Conjecture for almost perfect matchings

Dmitriy Kolupaev, Andrey Kupavskii

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 have a matching of size $s+1$? In this note, we improve upon a…