Polynomial-time perfect matchings in dense hypergraphs

DOI10.1145/2488608.2488647zbMath1293.05297OpenAlexW2963068836WikidataQ57255183 ScholiaQ57255183MaRDI QIDQ5495801

Peter Keevash, Fiachra Knox, Richard Mycroft

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/18597940/DivBarrierFinal.pdf

zbMATH Keywords

latticesperfect matchings

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Fractional and integer matchings in uniform hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ Unnamed Item ⋮ A geometric theory for hypergraph matching

This page was built for publication: Polynomial-time perfect matchings in dense hypergraphs