Title of article
On Erdősʹ extremal problem on matchings in hypergraphs
Author/Authors
?uczak، نويسنده , , Tomasz and Mieczkowska، نويسنده , , Katarzyna، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
17
From page
178
To page
194
Abstract
In 1965 Erdő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 large enough.
Keywords
Matching , Hypergraphs , extremal graph theory
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2014
Journal title
Journal of Combinatorial Theory Series A
Record number
1532005
Link To Document