The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree

DOI10.1007/978-3-642-10217-2_43zbMath1267.05212OpenAlexW1838065876MaRDI QIDQ3651570

Edyta Szymańska

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

zbMATH Keywords

polynomial time algorithmalmost perfect matchings

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree ⋮ A geometric theory for hypergraph matching

This page was built for publication: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree