An asymptotic independence theorem for the number of matchings in graphs (Q1043805)

From MaRDI portal
Revision as of 07:19, 2 July 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
An asymptotic independence theorem for the number of matchings in graphs
scientific article

    Statements

    An asymptotic independence theorem for the number of matchings in graphs (English)
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    0 references
    matchings
    0 references
    independence
    0 references
    set distance
    0 references
    asymptotic enumeration
    0 references
    0 references