arXiv Analytics

Sign in

arXiv:1605.06137 [math.CO]AbstractReferencesReviewsResources

Perfect Matchings in Random Bipartite Graphs in Random Environment

Jairo Bochi, Godofredo Iommi, Mario Ponce

Published 2016-05-19Version 1

In this note we study random bipartite graphs in random environment, as an extension of the classical Erd\"os-R\'enyi random graphs. We show that the expected number of perfect matchings obeys a precise quenched asymptotic.

Categories: math.CO, math.PR
Related articles: Most relevant | Search more
arXiv:1909.00214 [math.CO] (Published 2019-08-31)
An analogue of the Erdős-Gallai theorem for random graphs
arXiv:2108.04323 [math.CO] (Published 2021-08-09)
Isomorphisms between random graphs
arXiv:1009.0792 [math.CO] (Published 2010-09-04, updated 2021-09-01)
Warmth and mobility of random graphs

Links

Toolbox