Polynomial-time perfect matchings in dense hypergraphs

From MaRDI portal
(Redirected from Polynomial-time perfect matchings in dense hypergraphs)
Polynomial-time perfect matchings in dense hypergraphs (scientific article; zbMATH DE number 6326965)















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)