The number of matchings in random regular graphs and bipartite graphs (Q1081621)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of matchings in random regular graphs and bipartite graphs |
scientific article; zbMATH DE number 3970799
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of matchings in random regular graphs and bipartite graphs |
scientific article; zbMATH DE number 3970799 |
Statements
The number of matchings in random regular graphs and bipartite graphs (English)
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
0 references
0 references
