The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
From MaRDI portal
Publication:1933645
DOI10.1016/J.EJC.2011.12.009zbMath1257.05135OpenAlexW2021207464MaRDI QIDQ1933645
Publication date: 24 January 2013
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.12.009
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold
This page was built for publication: The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
