Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs

DOI10.1137/21M1408531MaRDI QIDQ5020839zbMATH OpenOpenAlexFDO

Authors Pedro Araújo, Simón Piga, M. Schacht

Publication date 7 January 2022

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

absorption methodEulerian graphsHamiltonian graphs

Mathematics Subject Classification ID

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

Abstract: We study sufficient conditions for the existence of Hamilton cycles in uniformly dense $3$-uniform hypergraphs. Problems of this type were first considered by Lenz, Mubayi, and Mycroft for loose Hamilton cycles and Aigner-Horev and Levy considered it for tight Hamilton cycles for a fairly strong notion of uniformly dense hypergraphs. We focus on tight cycles and obtain optimal results for a weaker notion of uniformly dense hypergraphs. We show that if an $n$-vertex $3$-uniform hypergraph $H=(V,E)$ has the property that for any set of vertices $X$ and for any collection $P$ of pairs of vertices, the number of hyperedges composed by a pair belonging to $P$ and one vertex from $X$ is at least $(1/4+o(1))|X||P|-o(|V{|}^3)$ and $H$ has minimum vertex degree at least $Omega(|V{|}^2)$, then $H$ contains a tight Hamilton cycle. A probabilistic construction shows that the constant $1/4$ is optimal in this context.

Recommendations

• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

Cites work

• σ-algebras for quasirandom hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• A note on Hamiltonian circuits
• Embedding tetrahedra into quasirandom hypergraphs
• Extremal problems in uniformly dense hypergraphs
• Hamilton cycles in quasirandom hypergraphs
• Hamiltonian chains in hypergraphs
• Holes in graphs
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• On extremal problems of graphs and generalized graphs
• Quasirandomness in hypergraphs
• Some remarks on _
• Some Theorems on Abstract Graphs
• Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs

Cited in

(9)

• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• scientific article; zbMATH DE number 7448677 (Why is no real title available?)
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• Minimum degree conditions for tight Hamilton cycles
• FF‐factors in Quasi‐random Hypergraphs
• Dirac-type conditions for spanning bounded-degree hypertrees
• Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
• A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
• Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs

This page was built for publication: Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs

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