Matchings in random biregular bipartite graphs (Q1953449)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matchings in random biregular bipartite graphs |
scientific article |
Statements
Matchings in random biregular bipartite graphs (English)
0 references
7 June 2013
0 references
Summary: 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 \textit{P. Erdős} and \textit{A. Rényi} [Publ. Math. Inst. Hung. Acad. Sci., Ser. A 8(1963), 455--461 (1964; Zbl 0133.26003)] 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.
0 references
random biregular bipartite graphs
0 references
perfect matchings
0 references
commutative graphs
0 references