Matchings in random biregular bipartite graphs
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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/20809 |
| Acceso en línea: | https://hdl.handle.net/2117/20809 |
| Access Level: | acceso abierto |
| Palabra clave: | Commutative graphs Random biregular bipartite graphs Perfect matchings Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta |
| Sumario: | 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. |
|---|