Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
From MaRDI portal
Publication:2349508
DOI10.1016/j.jctb.2015.03.007zbMath1315.05095arXiv1307.3693OpenAlexW3101931093MaRDI QIDQ2349508
Publication date: 22 June 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3693
Related Items (23)
Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Perfect packings in quasirandom hypergraphs. I. ⋮ Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Hamiltonian paths and cycles in some 4-uniform hypergraphs ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version ⋮ Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Hamiltonicity in randomly perturbed hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Exact minimum degree thresholds for perfect matchings 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
- Perfect matchings in 4-uniform hypergraphs
- 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
- Matchings in 3-uniform hypergraphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Families of triples with high minimum degree are Hamiltonian
- On Hamiltonian bipartite graphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Tiling 3-Uniform Hypergraphs With K43−2e
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- 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: Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
