Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
From MaRDI portal
Publication:4993132
DOI10.1017/S0963548320000486zbMath1466.05142arXiv1712.00186OpenAlexW3093185772MaRDI QIDQ4993132
Publication date: 15 June 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.00186
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Extremal set theory (05D05) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)
Related Items
Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding tetrahedra into quasirandom hypergraphs
- On extremal hypergraphs for Hamiltonian cycles
- On the Hamiltonicity of triple systems with high minimum degree
- Forbidding Hamilton cycles in uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Loose Hamilton cycles in hypergraphs
- 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
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Families of triples with high minimum degree are Hamiltonian
- Hamilton cycles in quasirandom hypergraphs
- σ-algebras for quasirandom hypergraphs
- Recent advances on Dirac-type problems for hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Some Remarks on π
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- The poset of hypergraph quasirandomness
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Some Theorems on Abstract Graphs
- Quasi-random graphs
- Quasirandomness in hypergraphs
This page was built for publication: Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs