Polynomial-time perfect matchings in dense hypergraphs

DOI10.1145/2488608.2488647MaRDI QIDQ5495801zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter Keevash, Fiachra Knox, Richard Mycroft

Publication date 7 August 2014

Published in Proceedings of the forty-eighth 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)

Recommendations

• Polynomial-time perfect matchings in dense hypergraphs
• Decision problem for perfect matchings in dense k-uniform hypergraphs
• The complexity of perfect matchings and packings in dense hypergraphs
• Perfect matchings in uniform hypergraphs with large minimum degree
• The Complexity of Perfect Matching Problems on Dense Hypergraphs

Cited in

(10)

• The complexity of perfect matchings and packings in dense hypergraphs
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Decision problem for perfect matchings in dense k-uniform hypergraphs
• Computational complexity of the perfect matching problem in hypergraphs with subcritical density
• The complexity of almost perfect matchings in uniform hypergraphs with high codegree
• The Complexity of Perfect Matching Problems on Dense Hypergraphs
• On vertex independence number of uniform hypergraphs
• Polynomial-time perfect matchings in dense hypergraphs
• A geometric theory for hypergraph matching
• On the Keevash-Knox-Mycroft conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495801)