Forbidding Hamilton cycles in uniform hypergraphs
From MaRDI portal
Publication:530769
DOI10.1016/j.jcta.2016.05.005zbMath1342.05082arXiv1508.05623OpenAlexW2201645533MaRDI QIDQ530769
Publication date: 1 August 2016
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05623
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items
Hamiltonicity in cherry-quasirandom 3-graphs ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Completion and deficiency problems ⋮ Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
Cites Work
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Loose Hamilton cycles in hypergraphs
- Perfect matchings in uniform hypergraphs with large minimum degree
- 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 and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Families of triples with high minimum degree are Hamiltonian
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- 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
- Some Theorems on Abstract Graphs
This page was built for publication: Forbidding Hamilton cycles in uniform hypergraphs
