Polynomial-time perfect matchings in dense hypergraphs (Q5495801)

From MaRDI portal
Revision as of 00:01, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    Polynomial-time perfect matchings in dense hypergraphs (English)
    0 references
    author
    Peter Keevash
    0 references
    Fiachra Knox
    0 references
    Richard Mycroft
    0 references
    publication date
    7 August 2014
    0 references
    zbMATH Keywords
    lattices
    0 references
    perfect matchings
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C70
    0 references
    05C65
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6326965
    0 references
    Wikidata QID
    Q57255183
    0 references
    OpenAlex ID
    W2963068836
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5495801&oldid=32504088"
    Powered by MediaWiki