On Erdos' extremal problem on matchings in hypergraphs
Combinatorics
2019-03-12 v1
Abstract
In 1965 Erd\H{o}s conjectured that the number of edges in k-uniform hypergraphs on n vertices in which the largest matching has s edges is maximized for hypergraphs of one of two special types. We settled this conjecture in the affirmative for k=3 and n is large enough.
Cite
@article{arxiv.1202.4196,
title = {On Erdos' extremal problem on matchings in hypergraphs},
author = {Tomasz Luczak and Katarzyna Mieczkowska},
journal= {arXiv preprint arXiv:1202.4196},
year = {2019}
}