A threshold for perfect matchings in random d-pure hypergraphs (Q1839262)

From MaRDI portal
Revision as of 09:06, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A threshold for perfect matchings in random d-pure hypergraphs
scientific article

    Statements

    A threshold for perfect matchings in random d-pure hypergraphs (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    random hypergraph
    0 references
    perfect matching
    0 references
    d-partite hypergraph
    0 references