Matchings in random biregular bipartite graphs
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdös and Rényi about perfect matchings in random bipartite graphs. We also present an application to commutative graphs, a class of graphs that are featured in additive number theory.
CitationPerarnau-Llobet, G.; Petridis, G. Matchings in random biregular bipartite graphs. "Electronic journal of combinatorics", 24 Març 2013, vol. 20, núm. 1, p. 1-30.