Perfect matchings in large uniform hypergraphs with large minimum collective degree

DOI10.1016/j.jcta.2008.10.002zbMath1214.05130OpenAlexW2144292514MaRDI QIDQ1024365

Endre Szemerédi, Andrzej Ruciński, Vojtěch Rödl

Publication date: 17 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.10.002

zbMATH Keywords

hypergraphminimum degreeperfect matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Perfect packings in quasirandom hypergraphs. I., A note on exact minimum degree threshold for fractional perfect matchings, Counting Hamilton cycles in Dirac hypergraphs, Matching of Given Sizes in Hypergraphs, Dirac-type theorems in random hypergraphs, Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Fractional and integer matchings in uniform hypergraphs, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, The Erdős matching conjecture and concentration inequalities, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, Embedding clique-factors in graphs with low \(\ell\)-independence number, On vertex independence number of uniform hypergraphs, Graph Tilings in Incompatibility Systems, Co-degree threshold for rainbow perfect matchings in uniform hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, Clique-factors in graphs with sublinear -independence number, Improved bound on vertex degree version of Erdős matching conjecture, Perfect matchings in 3-partite 3-uniform hypergraphs, Covering and tiling hypergraphs with tight cycles, \(d\)-matching in 3-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, On extremal hypergraphs for Hamiltonian cycles, Permanents of multidimensional matrices: Properties and applications, d-matching in k-uniform hypergraphs, 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, A Ramsey–Turán theory for tilings in graphs, Near Perfect Matchings ink-Uniform Hypergraphs, On Directed Versions of the Hajnal–Szemerédi Theorem, A note on perfect matchings in uniform hypergraphs, Almost Perfect Matchings in $k$-Partite $k$-Graphs, Perfect Packings in Quasirandom Hypergraphs II, Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Exact Minimum Codegree Threshold for K⁻₄-Factors, 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, Covering and tiling hypergraphs with tight cycles, On Perfect Matchings and Tilings in Uniform Hypergraphs, On the numbers of 1-factors and 1-factorizations of hypergraphs, Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three, Transitive triangle tilings in oriented graphs, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, On the Hamiltonicity of triple systems with high minimum degree, Matching in 3-uniform hypergraphs, Forbidding Hamilton cycles in uniform hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Unnamed Item, Unnamed Item, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree, The complexity of perfect matchings and packings in dense hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Triangle packings and 1-factors in oriented graphs, 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, A geometric theory for hypergraph matching, Vertex degree sums for matchings in 3-uniform hypergraphs, All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight), Tight bounds for powers of Hamilton cycles in tournaments, From one to many rainbow Hamiltonian cycles, \(F\)-factors in hypergraphs via absorption, 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, Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles

Cites Work

• Unnamed Item
• Perfect matchings in uniform hypergraphs with large minimum degree
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Hamiltonian chains in hypergraphs
• Matchings in hypergraphs of large minimum degree