Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

DOI10.1112/plms.12235zbMath1422.05077arXiv1611.03118OpenAlexW2951625213WikidataQ101365618 ScholiaQ101365618MaRDI QIDQ5237374

Christian Reiher, Andrzej Ruciński, Endre Szemerédi, Vojtěch Rödl, Mathias Schacht

Publication date: 17 October 2019

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Dirac's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items

Hamiltonicity in cherry-quasirandom 3-graphs, Counting Hamilton cycles in Dirac hypergraphs, Hamiltonian paths and cycles in some 4-uniform hypergraphs, 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, Minimum degree conditions for tight Hamilton cycles, A general approach to transversal versions of Dirac‐type theorems, Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Tight cycles and regular slices in dense hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, On Hamiltonian cycles in hypergraphs with dense link graphs, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Embedding spanning subgraphs in uniformly dense and inseparable graphs, 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, Decomposing hypergraphs into cycle factors, Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs