Families of triples with high minimum degree are Hamiltonian
From MaRDI portal
Publication:2450131
DOI10.7151/dmgt.1743zbMath1290.05114OpenAlexW2044905288MaRDI QIDQ2450131
Vojtěch Rödl, Andrzej Ruciński
Publication date: 16 May 2014
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1743
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items
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, Minimum degree conditions for tight Hamilton cycles, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the Hamiltonicity of triple systems with high minimum degree, Forbidding Hamilton cycles in uniform hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, Powers of tight Hamilton cycles in randomly perturbed 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 in uniform hypergraphs with large minimum degree
- 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
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Matchings in 3-uniform hypergraphs
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Hamiltonian chains in hypergraphs
- Matchings in hypergraphs of large minimum degree
