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

From MaRDI portal
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