Article ID Journal Published Year Pages File Type
4655311 Journal of Combinatorial Theory, Series A 2014 17 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On Erdős' extremal problem on matchings in hypergraphs
Authors
, ,