Polynomial-time perfect matchings in dense hypergraphs (Q5495801)

From MaRDI portal
Revision as of 14:28, 28 December 2023 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57255183, #quickstatements; #temporary_batch_1703769339033)
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

    0 references
    0 references
    0 references
    0 references
    0 references