arXiv · cond-mat/0603350
The number of matchings in random graphs
Abstract
We study matchings on sparse random graphs by means of the cavity method. We first show how the method reproduces several known results about maximum and perfect matchings in regular and Erdos-Renyi random graphs. Our main new result is the computation of the entropy, i.e. the leading order of the logarithm of the number of solutions, of matchings with a given size. We derive both an algorithm to compute this entropy for an arbitrary graph with a girth that diverges in the large size limit, and an analytic result for the entropy in regular and Erdos-Renyi random graph ensembles.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Lenka Zdeborová, Marc Mézard. 2006-05-05. The number of matchings in random graphs. https://doi.org/10.1088/1742-5468%2F2006%2F05%2Fp05003
Cite the original work for its findings. Save a collection to share your selection of sources.