Mostra el registre d'ítem simple

dc.contributor.authorPerarnau Llobet, Guillem
dc.contributor.authorPetridis, Georgios
dc.date.accessioned2013-11-27T11:49:54Z
dc.date.available2013-11-27T11:49:54Z
dc.date.created2013-03-24
dc.date.issued2013-03-24
dc.identifier.citationPerarnau-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.issn1077-8926
dc.identifier.urihttp://hdl.handle.net/2117/20809
dc.description.abstractWe 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.format.extent30 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta
dc.subject.lcshCommutative graphs
dc.subject.otherRandom biregular bipartite graphs
dc.subject.otherPerfect matchings
dc.subject.otherCommutative graphs
dc.titleMatchings in random biregular bipartite graphs
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.combinatorics.org/ojs/index.php/eljc/index
dc.rights.accessOpen Access
local.identifier.drac12496531
dc.description.versionPostprint (published version)
local.citation.authorPerarnau-Llobet, G.; Petridis, G.
local.citation.publicationNameElectronic journal of combinatorics
local.citation.volume20
local.citation.number1
local.citation.startingPage1
local.citation.endingPage30


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple