A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
From MaRDI portal
Publication:6632775
DOI10.1017/S096354832300007XMaRDI QIDQ6632775
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A degree sequence Hajnal-Szemerédi theorem
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- The uniformity lemma for hypergraphs
- On a Turán problem in weakly quasirandom 3-uniform hypergraphs
- On Hamiltonian cycles in hypergraphs with dense link graphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- On Hamilton's ideals
- Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
- On Degree Sequences Forcing The Square of a Hamilton Cycle
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Hamiltonian chains in hypergraphs
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Some Theorems on Abstract Graphs
- Minimum degree conditions for tight Hamilton cycles
This page was built for publication: A pair degree condition for 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 Q6632775)
