Publication:3078214
From MaRDI portal
zbMath1221.05255MaRDI QIDQ3078214
Vojtěch Rödl, Andrzej Ruciński
Publication date: 18 February 2011
05C65: Hypergraphs
Related Items
Almost Perfect Matchings in $k$-Partite $k$-Graphs, On Perfect Matchings and Tilings in Uniform Hypergraphs, Nearly Perfect Matchings in Uniform Hypergraphs, Pseudorandom hypergraph matchings, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Matching of Given Sizes in Hypergraphs, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Near Perfect Matchings ink-Uniform Hypergraphs, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, A geometric theory for hypergraph matching, Counting Hamilton cycles in Dirac hypergraphs, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Tight cycles in hypergraphs, Perfect matchings in 3-partite 3-uniform hypergraphs, On extremal hypergraphs for Hamiltonian cycles, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Polynomial-time perfect matchings in dense hypergraphs, Tight cycles and regular slices in dense hypergraphs, On the Hamiltonicity of triple systems with high minimum degree, Forbidding Hamilton cycles in uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Hamiltonicity in randomly perturbed hypergraphs, Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering, Packing \(k\)-partite \(k\)-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version, \(d\)-matching in 3-uniform hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, Hamilton saturated hypergraphs of essentially minimum size, On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs, Hamiltonicity in cherry-quasirandom 3-graphs, Dirac-type theorems in random hypergraphs, A Dirac-type theorem for Berge cycles in random hypergraphs, Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles, Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, The complexity of perfect matchings and packings in dense hypergraphs, Co-degrees resilience for perfect matchings in random hypergraphs, Rainbow factors in hypergraphs, Vertex degree sums for matchings in 3-uniform hypergraphs, \(F\)-factors in hypergraphs via absorption, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Families of triples with high minimum degree are Hamiltonian, Properly colored Hamilton cycles in Dirac-type hypergraphs, Unnamed Item, Unnamed Item, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
