The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
From MaRDI portal
Publication:2400547
DOI10.1016/j.disc.2016.12.015zbMath1369.05036arXiv1606.05616OpenAlexW2964098318MaRDI QIDQ2400547
Oliver Cooley, Richard Mycroft
Publication date: 29 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.05616
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (4)
Minimum degree conditions for tight Hamilton cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version
- Tight cycles and regular slices in dense hypergraphs
- 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
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Families of triples with high minimum degree are Hamiltonian
- Recent advances on Dirac-type problems for hypergraphs
- On maximal paths and circuits of graphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- Some Theorems on Abstract Graphs
This page was built for publication: The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
