Erd\H{o}s Matching Conjecture for almost perfect matchings
Combinatorics
2022-12-20 v2 Discrete Mathematics
Abstract
In 1965 Erd\H{o}s asked, what is the largest size of a family of -element subsets of an -element set that does not have a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and .
Cite
@article{arxiv.2206.01526,
title = {Erd\H{o}s Matching Conjecture for almost perfect matchings},
author = {Dmitriy Kolupaev and Andrey Kupavskii},
journal= {arXiv preprint arXiv:2206.01526},
year = {2022}
}