The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
From MaRDI portal
Publication:3651570
DOI10.1007/978-3-642-10217-2_43zbMath1267.05212MaRDI QIDQ3651570
Publication date: 11 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_43
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A geometric theory for hypergraph matching, Polynomial-time perfect matchings in dense hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree