An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
From MaRDI portal
Publication:949794
DOI10.1007/s00493-008-2295-zzbMath1164.05051OpenAlexW2134184632WikidataQ105583443 ScholiaQ105583443MaRDI QIDQ949794
Andrzej Ruciński, Endre Szemerédi, Vojtěch Rödl
Publication date: 21 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2295-z
Related Items
Hypergraph Extensions of the Erdős-Gallai Theorem, Counting Hamilton cycles in Dirac hypergraphs, Extension of paths and cycles for hypergraphs, Bounds on the number of edges in hypertrees, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Minimum Degrees for Powers of Paths and Cycles, Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs, Packing hamilton cycles in random and pseudo-random hypergraphs, Cycles and matchings in randomly perturbed digraphs and hypergraphs, Tight cycles in hypergraphs, Hamiltonian paths and cycles in some 4-uniform hypergraphs, Robust Hamiltonicity of random directed graphs, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, Euler tours in hypergraphs, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, 2-universality in randomly perturbed graphs, Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Spanning trees in dense directed graphs, Improved monochromatic loose cycle partitions in hypergraphs, Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths, Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths, Fractional cycle decompositions in hypergraphs, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, 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, \(d\)-matching in 3-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, On extremal hypergraphs for Hamiltonian cycles, Minimum degree conditions for tight Hamilton cycles, d-matching in k-uniform hypergraphs, A general approach to transversal versions of Dirac‐type theorems, Loose Hamilton cycles in hypergraphs, Dirac-type conditions for spanning bounded-degree hypertrees, Properly colored Hamilton cycles in Dirac-type hypergraphs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Recent advances on the Hamiltonian problem: survey III, On Tight Cycles in Hypergraphs, Almost all Steiner triple systems are almost resolvable, Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs, Families of triples with high minimum degree are Hamiltonian, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version, Tight cycles and regular slices in dense hypergraphs, On vertex-disjoint paths in regular graphs, On the Hamiltonicity of triple systems with high minimum degree, An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs, \(K_r\)-factors in graphs with low independence number, Matching in 3-uniform hypergraphs, Forbidding Hamilton cycles in uniform hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, On Hamiltonian Berge cycles in [3-uniform hypergraphs], Linear trees in uniform hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY, On Hamiltonian cycles in hypergraphs with dense link graphs, Rainbow pancyclicity in graph systems, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Hamilton cycles in quasirandom hypergraphs, Perfect matchings in large uniform hypergraphs with large minimum collective degree, A hypergraph blow-up lemma, Triangle packings and 1-factors in oriented graphs, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, Hamiltonicity in random directed graphs is born resilient, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Hamiltonicity in randomly perturbed hypergraphs, Spanning trees in random graphs, Vertex degree sums for matchings in 3-uniform hypergraphs, Tight Hamilton cycles in random hypergraphs, A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs, Decomposing hypergraphs into cycle factors, Tight bounds for powers of Hamilton cycles in tournaments, Minimum Vertex Degree Threshold for ‐tiling*, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, Transversal factors and spanning trees
Cites Work
