Hamiltonian paths and cycles in some 4-uniform hypergraphs

DOI10.1007/S00373-022-02524-9zbMath1493.05217arXiv2104.05016OpenAlexW3155786981WikidataQ114229600 ScholiaQ114229600MaRDI QIDQ2157837

Xiaonan Liu, Guanwu Liu

Publication date: 22 July 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-uniform hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• On the Hamiltonicity of triple systems with high minimum degree
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• The Ramsey number for hypergraph cycles. I.
• 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
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Hamiltonian chains in hypergraphs
• Extremal problems on set systems
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• Some Theorems on Abstract Graphs

This page was built for publication: Hamiltonian paths and cycles in some 4-uniform hypergraphs