Matchings in Random Biregular Bipartite Graphs
Combinatorics
2013-09-10 v2
Abstract
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 Erdos and Renyi 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.
Cite
@article{arxiv.1205.4130,
title = {Matchings in Random Biregular Bipartite Graphs},
author = {Guillem Perarnau and Giorgis Petridis},
journal= {arXiv preprint arXiv:1205.4130},
year = {2013}
}
Comments
30 pages and 3 figures - Latest version has updated introduction and bibliography