Matchings in random biregular bipartite graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/20809

dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Perarnau Llobet, Guillem
dc.contributor.author	Petridis, Georgios
dc.date	2013-03-24
dc.identifier.citation	Perarnau-Llobet, G.; Petridis, G. Matchings in random biregular bipartite graphs. "Electronic journal of combinatorics", 24 Març 2013, vol. 20, núm. 1, p. 1-30.
dc.identifier.citation	1077-8926
dc.identifier.uri	http://hdl.handle.net/2117/20809
dc.language.iso	eng
dc.relation	http://www.combinatorics.org/ojs/index.php/eljc/index
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta
dc.subject	Commutative graphs
dc.subject	Random biregular bipartite graphs
dc.subject	Perfect matchings
dc.subject	Commutative graphs
dc.subject	Grafs, Teoria de
dc.title	Matchings in random biregular bipartite graphs
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.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 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.
dc.description.abstract	Peer Reviewed