Back to Search
Start Over
On Erdős' extremal problem on matchings in hypergraphs.
- Source :
-
Journal of Combinatorial Theory - Series A . May2014, Vol. 124, p178-194. 17p. - Publication Year :
- 2014
-
Abstract
- 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 and n large enough. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00973165
- Volume :
- 124
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series A
- Publication Type :
- Academic Journal
- Accession number :
- 94870352
- Full Text :
- https://doi.org/10.1016/j.jcta.2014.01.003