scientific article
From MaRDI portal
Publication:3078214
zbMath1221.05255MaRDI QIDQ3078214
Vojtěch Rödl, Andrzej Ruciński
Publication date: 18 February 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Hamiltonicity in cherry-quasirandom 3-graphs, Counting Hamilton cycles in Dirac hypergraphs, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Matching of Given Sizes in Hypergraphs, Dirac-type theorems in random hypergraphs, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Tight cycles in hypergraphs, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching 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, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, Factors in randomly perturbed 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, Perfect matchings in 3-partite 3-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, A Dirac-type theorem for Berge cycles in random hypergraphs, Minimum degree conditions for tight Hamilton cycles, Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, Near Perfect Matchings ink-Uniform Hypergraphs, Properly colored Hamilton cycles in Dirac-type hypergraphs, Almost Perfect Matchings in $k$-Partite $k$-Graphs, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Hamilton saturated hypergraphs of essentially minimum size, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs, Families of triples with high minimum degree are Hamiltonian, Polynomial-time perfect matchings in dense hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On Perfect Matchings and Tilings in Uniform 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, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, Unnamed Item, Unnamed Item, On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs, The complexity of perfect matchings and packings in dense hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, Co-degrees resilience for perfect matchings in random hypergraphs, Rainbow factors in hypergraphs, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-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, Hamiltonicity in randomly perturbed hypergraphs, A geometric theory for hypergraph matching, Vertex degree sums for matchings in 3-uniform hypergraphs, Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering, A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs, \(F\)-factors in hypergraphs via absorption, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
