On the Hamiltonicity of triple systems with high minimum degree

DOI10.1007/s00026-017-0345-1zbMath1359.05089arXiv1605.00773OpenAlexW3099266942MaRDI QIDQ521911

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

Publication date: 12 April 2017

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsHamiltonian cyclesDirac's theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamiltonian paths and cycles in some 4-uniform hypergraphs, Minimum degree conditions for tight Hamilton cycles, Properly colored Hamilton cycles in Dirac-type hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Hamilton cycles in hypergraphs below the Dirac threshold, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs

Cites Work

• On extremal hypergraphs for Hamiltonian cycles
• Forbidding Hamilton cycles in uniform hypergraphs
• 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
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• The uniformity lemma for hypergraphs
• Matchings in 3-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• On extremal problems of graphs and generalized graphs
• Families of triples with high minimum degree are Hamiltonian
• Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
• Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs
• On Sets of Acquaintances and Strangers at any Party
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On the Minimal Density of Triangles in Graphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Regularity lemmas for hypergraphs and quasi-randomness
• Hamiltonian chains in hypergraphs
• Triangles in an Ordinary Graph
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item