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

DOI10.1112/PLMS.12235zbMATH Open1422.05077arXiv1611.03118OpenAlexW2951625213WikidataQ101365618 ScholiaQ101365618MaRDI QIDQ5237374FDOQ5237374

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

Publication date: 17 October 2019

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

Abstract: We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.

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

Recommendations

• Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
• Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Minimum degree conditions for tight Hamilton cycles
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
• Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs

zbMATH Keywords

Dirac's theorem

Mathematics Subject Classification ID

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

Cited In (34)

• Hamiltonian paths and cycles in some 4-uniform hypergraphs
• A general approach to transversal versions of Dirac‐type theorems
• Embedding loose spanning trees in 3-uniform hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Hamilton cycles in hypergraphs below the Dirac threshold
• Hamiltonicity in cherry-quasirandom 3-graphs
• Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Transference for loose Hamilton cycles in random 3-uniform hypergraphs
• On powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Resilience for tight Hamiltonicity
• Optimal spread for spanning subgraphs of Dirac hypergraphs
• Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
• Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
• Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs
• On Hamiltonian cycles in hypergraphs with dense link graphs
• Minimum degree conditions for tight Hamilton cycles
• Decomposing hypergraphs into cycle factors
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
• Minimum degree ensuring that a hypergraph is Hamiltonian-connected
• Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
• A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Hamiltonicity in randomly perturbed hypergraphs
• Embedding spanning subgraphs in uniformly dense and inseparable graphs
• Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
• Transversal Hamilton cycle in hypergraph systems
• Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
• Title not available (Why is that?)
• Tight cycles and regular slices in dense hypergraphs
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
• Counting Hamilton cycles in Dirac hypergraphs

This page was built for publication: Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237374)