On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree

DOI10.1137/080729657zbMath1191.05074OpenAlexW2070866278MaRDI QIDQ3563938

Hiệp Hàn, Mathias Schacht, Yury Person

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/31cf7f03fcfc7b447e6140528f0fdb100873b8c8

zbMATH Keywords

uniform hypergraphperfect matchingdegree condition

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 (62)

Perfect packings in quasirandom hypergraphs. I. ⋮ Stability on matchings in 3-uniform hypergraphs ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ 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 ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ On extremal hypergraphs for Hamiltonian cycles ⋮ Nonnegative \(k\)-sums, fractional covers, and probability of small deviations ⋮ d-matching in k-uniform hypergraphs ⋮ Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ Near Perfect Matchings ink-Uniform Hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ 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 ⋮ Almost all Steiner triple systems are almost resolvable ⋮ 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 ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ 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 ⋮ Towards a Weighted Version of the Hajnal–Szemerédi Theorem ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs ⋮ Unnamed Item ⋮ Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ Pseudorandom hypergraph matchings ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ A geometric theory for hypergraph matching ⋮ Degree versions of theorems on intersecting families via stability ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ From one to many rainbow Hamiltonian cycles ⋮ \(F\)-factors in hypergraphs via absorption ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

This page was built for publication: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree