ISSN:
1439-6912
Keywords:
AMS Subject Classification (1991) Classes: 05C65, 05C70, 05C80, 60C05, 60F05, 60G42
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
d -regular graph G, let M be chosen uniformly at random from the set of all matchings of G, and for let be the probability that M does not cover x. We show that for large d, the 's and the mean μ and variance of are determined to within small tolerances just by d and (in the case of μ and ) : Theorem. For any d-regular graph G, (a) , so that , (b) , where the rates of convergence depend only on d.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/PL00009817
Permalink