The decision problem for perfect matchings in dense hypergraphs

DOI10.4230/LIPICS.ICALP.2022.64MaRDI QIDQ6560858zbMATH OpenFDO

Authors Luyining Gan, Jie Han

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.64

zbMATH Keywords

computational complexityhypergraphperfect matching

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(1)

• On the Keevash-Knox-Mycroft conjecture

This page was built for publication: The decision problem for perfect matchings in dense hypergraphs

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