Matchings in Random Biregular Bipartite Graphs
Keyword(s):
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.
1998 ◽
Vol 19
(3)
◽
pp. 343-353
◽
2009 ◽
Vol 53
(1)
◽
pp. 219-235
◽
1979 ◽
Vol 02
(1)
◽
pp. 159-182
◽
2005 ◽
Vol 01
(04)
◽
pp. 563-581
◽