Minimum degree conditions for tight Hamilton cycles
From MaRDI portal
Publication:6133938
DOI10.1112/jlms.12561zbMath1519.05142arXiv2005.05291OpenAlexW3022405419MaRDI QIDQ6133938
Richard Lang, Nicolás Sanhueza-Matamala
Publication date: 21 August 2023
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.05291
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (8)
On sufficient conditions for spanning structures in dense graphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ Decomposing hypergraphs into cycle factors ⋮ Towards Lehel's conjecture for 4-uniform tight cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight cycles and regular slices in dense hypergraphs
- 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
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Vertex coverings by monochromatic cycles and trees
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Blow-up lemma
- Hypergraphs, quasi-randomness, and conditions for regularity
- On Hamiltonian cycles in hypergraphs with dense link graphs
- On the decomposition threshold of a given graph
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Recent advances on the Hamiltonian problem: survey III
- Families of triples with high minimum degree are Hamiltonian
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Recent advances on Dirac-type problems for hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
- Hamiltonian chains in hypergraphs
- Triangle Factors in Random Graphs
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Extremal Problems for Finite Sets
- Regularity Lemma for k-uniform hypergraphs
- Covering and tiling hypergraphs with tight cycles
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- Balanced matrices
- Some Theorems on Abstract Graphs
This page was built for publication: Minimum degree conditions for tight Hamilton cycles
