Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs

DOI10.1016/j.jcta.2015.01.004zbMath1307.05133arXiv1406.2225OpenAlexW2076302993MaRDI QIDQ2258905

Yi Zhao, Jie Han

Publication date: 27 February 2015

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2225

zbMATH Keywords

hypergraphregularity lemmaHamilton cycleabsorbing method

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version ⋮ Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version ⋮ An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Hamiltonicity in randomly perturbed hypergraphs ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On extremal hypergraphs for Hamiltonian cycles
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Tiling 3-Uniform Hypergraphs With K43−2e
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Hamiltonian chains in hypergraphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Some Theorems on Abstract Graphs