Dirac-type results for loose Hamilton cycles in uniform hypergraphs
From MaRDI portal
Publication:965258
DOI10.1016/j.jctb.2009.10.002zbMath1209.05161MaRDI QIDQ965258
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.10.002
Related Items
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Counting Hamilton cycles in Dirac hypergraphs, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, 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, Bounds on the number of edges in hypertrees, On extremal hypergraphs for Hamiltonian cycles, Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version, On the Hamiltonicity of triple systems with high minimum degree, An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs, Forbidding Hamilton cycles in uniform hypergraphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Loose Hamilton cycles in hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Hamiltonicity in randomly perturbed hypergraphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version, Hamilton cycles in hypergraphs below the Dirac threshold, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, Hamiltonian paths and cycles in some 4-uniform hypergraphs, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, 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, Properly colored Hamilton cycles in Dirac-type hypergraphs, Hamilton cycles in quasirandom hypergraphs, Packing tight Hamilton cycles in 3-uniform hypergraphs, Packing hamilton cycles in random and pseudo-random hypergraphs, A hypergraph blow-up lemma, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- The uniformity lemma for hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Hamiltonian chains in hypergraphs
- Matchings in hypergraphs of large minimum degree
- On a problem of K. Zarankiewicz
