On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
From MaRDI portal
Publication:3563938
DOI10.1137/080729657zbMath1191.05074MaRDI 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
05C35: Extremal problems in graph theory
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
d-matching in k-uniform hypergraphs, On Perfect Matchings and Tilings in Uniform Hypergraphs, Towards a Weighted Version of the Hajnal–Szemerédi Theorem, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, Nearly Perfect Matchings in Uniform Hypergraphs, Pseudorandom hypergraph matchings, 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, Almost all Steiner triple systems are almost resolvable, Near Perfect Matchings ink-Uniform Hypergraphs, Perfect Packings in Quasirandom Hypergraphs II, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, A geometric theory for hypergraph matching, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs, Co-degree threshold for rainbow perfect matchings in uniform hypergraphs, Improved bound on vertex degree version of Erdős matching conjecture, Perfect packings in quasirandom hypergraphs. I., On vertex independence number of uniform hypergraphs, Perfect matchings in 3-partite 3-uniform hypergraphs, On extremal hypergraphs for Hamiltonian cycles, Nonnegative \(k\)-sums, fractional covers, and probability of small deviations, 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, 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, Forbidding Hamilton cycles in uniform hypergraphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Packing \(k\)-partite \(k\)-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, A note on perfect matchings in uniform hypergraphs, Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree, Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles, \(d\)-matching in 3-uniform hypergraphs, On multipartite Hajnal-Szemerédi theorems, Matching in 3-uniform hypergraphs, Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs, From one to many rainbow Hamiltonian cycles, Stability on matchings in 3-uniform hypergraphs, Dirac-type theorems in random hypergraphs, The Erdős matching conjecture and concentration inequalities, The complexity of perfect matchings and packings in dense hypergraphs, Degree versions of theorems on intersecting families via stability, 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, Families of triples with high minimum degree are Hamiltonian, Fractional and integer matchings in uniform hypergraphs, Unnamed Item, Triangle factors of graphs without large independent sets and of weighted graphs, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY, 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
