The number of matchings in random regular graphs and bipartite graphs (Q1081621)

From MaRDI portal
Revision as of 15:13, 17 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
The number of matchings in random regular graphs and bipartite graphs
scientific article

    Statements

    The number of matchings in random regular graphs and bipartite graphs (English)
    0 references
    0 references
    0 references
    1986
    0 references
    For \(3\leq k\leq (\log n)^{1/3}\) and n even, the expectation and variance of the number of 1-factors in random labelled k-regular graphs of order n are derived. Results are also presented for random regular bipartite graphs.
    0 references
    random graphs
    0 references
    random bipartite graphs
    0 references
    1-factors
    0 references

    Identifiers