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.
@article{10_37236_2658,
author = {Guillem Perarnau and Giorgis Petridis},
title = {Matchings in random biregular bipartite graphs},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {1},
doi = {10.37236/2658},
zbl = {1266.05123},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2658/}
}
TY - JOUR
AU - Guillem Perarnau
AU - Giorgis Petridis
TI - Matchings in random biregular bipartite graphs
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/2658/
DO - 10.37236/2658
ID - 10_37236_2658
ER -
%0 Journal Article
%A Guillem Perarnau
%A Giorgis Petridis
%T Matchings in random biregular bipartite graphs
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2658/
%R 10.37236/2658
%F 10_37236_2658
Guillem Perarnau; Giorgis Petridis. Matchings in random biregular bipartite graphs. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/2658
