Erd\H{o}s Matching Conjecture for almost perfect matchings

DOI10.1016/J.DISC.2022.113304arXiv2206.01526WikidataQ123161001 ScholiaQ123161001MaRDI QIDQ6401022FDOQ6401022

Authors: Dmitriy Kolupaev, Andrey B. Kupavskii 

Publication date: 3 June 2022

Abstract: In 1965 ErdH{o}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 recent result of Frankl and resolve this problem for $s>101k^3$ and $(s+1)klen<(s+1)(k+frac1100k)$.

Mathematics Subject Classification ID

Extremal set theory (05D05)

This page was built for publication: Erd\H{o}s Matching Conjecture for almost perfect matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401022)