Name
Abstract | ||
|---|---|---|
For 1≤d≤ℓ<k, we give a new lower bound for the minimum d-degree threshold that guarantees a Hamilton ℓ-cycle in k-uniform hypergraphs. When k≥4 and d<ℓ=k−1, this bound is larger than the conjectured minimum d-degree threshold for perfect matchings and thus disproves a well-known conjecture of Rödl and Ruciński. Our (simple) construction generalizes a construction of Katona and Kierstead and the space barrier for Hamilton cycles. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jcta.2016.05.005 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Hamilton cycles,Hypergraphs,Perfect matchings | Discrete mathematics,Combinatorics,Upper and lower bounds,Constraint graph,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
143 | C | 0097-3165 |
Citations | PageRank | References |
1 | 0.36 | 15 |
Authors | ||
2 | ||