Polynomial-time perfect matchings in dense hypergraphs (Q5495801)

From MaRDI portal
Revision as of 21:01, 28 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6326965
Language Label Description Also known as
English
Polynomial-time perfect matchings in dense hypergraphs
scientific article; zbMATH DE number 6326965

    Statements

    Polynomial-time perfect matchings in dense hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2014
    0 references
    lattices
    0 references
    perfect matchings
    0 references

    Identifiers