Squares of Hamiltonian cycles in 3-uniform hypergraphs

DOI10.1002/RSA.20876zbMATH Open1436.05057arXiv1712.08231OpenAlexW2963911587WikidataQ127437983 ScholiaQ127437983MaRDI QIDQ5113942FDOQ5113942

Christian Reiher, Wiebke Bedenknecht

Publication date: 19 June 2020

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Abstract: We show that every $3$-uniform hypergraph $H=(V,E)$ with $|V(H)|=n$ and minimum pair degree at least $(4/5+o(1))n$ contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the P'osa-Seymour conjecture.

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

Recommendations

• On Hamiltonian cycles in hypergraphs with dense link graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• scientific article
• On degree sequences forcing the square of a Hamilton cycle

zbMATH Keywords

Hamiltonian cycleshypergraphsPósa's conjecture

Mathematics Subject Classification ID

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

Cited In (2)

• On powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Embedding spanning subgraphs in uniformly dense and inseparable graphs

This page was built for publication: Squares of 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 Q5113942)