Finding Perfect Matchings in Dense Hypergraphs

DOI10.1137/1.9781611975994.145MaRDI QIDQ5146935zbMATH OpenOpenAlexFDO

Authors Jie Han, Peter Keevash

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.145

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• The Complexity of Perfect Matching Problems on Dense Hypergraphs
• FF‐factors in Quasi‐random Hypergraphs
• On the Keevash-Knox-Mycroft conjecture

This page was built for publication: Finding Perfect Matchings in Dense Hypergraphs

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