The number of matchings in random regular graphs and bipartite graphs (Q1081621): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(86)90029-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093881947 / rank | |||
Normal rank | |||
Revision as of 21:19, 19 March 2024
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
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
