Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
2011 (English)In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 32, no 5, 677-687 p.Article in journal (Refereed) Published
We establish a new lower bound on the l-wise collective minimum degree which guarantees the existence of a perfect matching in a k-uniform hypergraph, where 1 <= l < k/2. For l = 1, this improves a long-standing bound of Daykin and Haggkvist (1981) . Our proof is a modification of the approach of Han et al. (2009) from . In addition, we fill a gap left by the results solving a similar question for the existence of Hamilton cycles. (C) 2011 Published by Elsevier Ltd
Place, publisher, year, edition, pages
London: Elsevier, 2011. Vol. 32, no 5, 677-687 p.
k-uniform hypergraphs, large minimum degree, dirac-type theorem, 3-uniform hypergraphs, rysers conjecture, independent edges, complexity, codegree, partite
IdentifiersURN: urn:nbn:se:umu:diva-52107DOI: 10.1016/J.Ejc.2011.02.001ISI: 000291134300004OAI: oai:DiVA.org:umu-52107DiVA: diva2:496883