An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs

DOI10.1016/J.DISC.2017.02.018zbMATH Open1361.05071OpenAlexW2600022275MaRDI QIDQ526237FDOQ526237

Guiying Yan, Yu Cong Tang

Publication date: 10 May 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.02.018

zbMATH Keywords

cycleHamiltonianhypergraphOre-type

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Hypergraphs (05C65)

Cites Work

• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs
• Hamiltonian chains in hypergraphs
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• 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
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs

Cited In (7)

• Vertex degree sums for matchings in 3-uniform hypergraphs
• Vertex degree sums for matchings in 3-uniform hypergraphs
• Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
• Vertex degree sums for perfect matchings in 3-uniform hypergraphs
• Matching in 3-uniform hypergraphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• Title not available (Why is that?)

This page was built for publication: An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs

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