Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs

DOI10.1137/120890417zbMath1296.05113arXiv1308.0721OpenAlexW2085080447MaRDI QIDQ4979823

Theodore Molla, Andrzej Czygrinow

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphHamilton cycle3-graphabsorbing lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)

Related Items (16)

Counting Hamilton cycles in Dirac hypergraphs ⋮ Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Hamiltonian paths and cycles in some 4-uniform hypergraphs ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ 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 ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Hamiltonicity in randomly perturbed hypergraphs ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

This page was built for publication: Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs