Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
From MaRDI portal
Publication:5020839
DOI10.1137/21M1408531zbMath1480.05097arXiv2005.11942OpenAlexW4205379069MaRDI QIDQ5020839
Simón Piga, Pedro Araújo, Mathias 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
Related Items (2)
F$F$‐factors in Quasi‐random Hypergraphs ⋮ Dirac-type conditions for spanning bounded-degree hypertrees
Cites Work
- Unnamed Item
- A problem of Erdős and Sós on 3-graphs
- Embedding tetrahedra into quasirandom hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Extremal problems in uniformly dense hypergraphs
- On extremal problems of graphs and generalized graphs
- A note on Hamiltonian circuits
- Hamilton cycles in quasirandom hypergraphs
- Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs
- σ-algebras for quasirandom hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
- Some Remarks on π
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Some Theorems on Abstract Graphs
- Quasirandomness in hypergraphs
- Holes in graphs
This page was built for publication: Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
