Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
From MaRDI portal
Publication:859609
DOI10.1016/j.jctb.2006.02.004zbMath1109.05065OpenAlexW2053158631MaRDI QIDQ859609
Publication date: 16 January 2007
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.2006.02.004
Related Items
Perfect packings in quasirandom hypergraphs. I. ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ Bounds on the number of edges in hypertrees ⋮ Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Co-degree density of 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 ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ On vertex independence number of uniform hypergraphs ⋮ Packing \(k\)-partite \(k\)-uniform 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 ⋮ Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Loose Hamilton cycles in hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues ⋮ Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version ⋮ Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Families of triples with high minimum degree are Hamiltonian ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Note on the 3-graph counting Lemma ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ An approximate Dirac-type theorem for \(k\)-uniform hypergraphs ⋮ Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version ⋮ Limiting distribution of short cycles in inhomogeneous random uniform hypergraph ⋮ 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 ⋮ Cycles of given length in oriented graphs ⋮ Dirac-type results for loose Hamilton cycles in uniform hypergraphs ⋮ Hamilton-chain saturated hypergraphs ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs ⋮ Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs ⋮ Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ Hamilton \(\ell \)-cycles in uniform hypergraphs ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Linear trees in uniform hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ A hypergraph blow-up lemma ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs ⋮ Spectra of cycle and path families of oriented hypergraphs ⋮ Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Hamiltonicity in randomly perturbed hypergraphs ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs ⋮ \(F\)-factors in hypergraphs via absorption ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs ⋮ Minimum Vertex Degree Threshold for ‐tiling* ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs ⋮ Tiling 3-Uniform Hypergraphs With K43−2e
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect matchings in uniform hypergraphs with large minimum degree
- Matching theory
- Blow-up lemma
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- Regularity properties for triple systems
- Extremal problems on set systems
- On characterizing hypergraph regularity
- Regularity Lemma for k-uniform hypergraphs
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
- Matchings in hypergraphs of large minimum degree
- Proof of the Alon-Yuster conjecture
