The number of matchings in random regular graphs and bipartite graphs

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

If 3 ≤ k ≤ (logn)1 3 and n is even, then the number of 1-factors in random labelled k-regular graphs of order n has expectation ( 2+o(n- 2 3))e 1 4(( k-1)k-1 kk-2)3n 2 and variance (1+o(n- 1 2))e 1 2(( k-1)k-1 kk-2)ne-( 2k-1 4(k-1)2 k-1 k-21 2-1 A similar result is proved for random regular bipartite graphs. © 1986.

Cite

CITATION STYLE

APA

Bollobás, B., & McKay, B. D. (1986). The number of matchings in random regular graphs and bipartite graphs. Journal of Combinatorial Theory, Series B, 41(1), 80–91. https://doi.org/10.1016/0095-8956(86)90029-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free