dc.contributor |
Centre de Recerca Matemàtica |
dc.contributor.author |
McDiarmid, Colin |
dc.date.accessioned |
2008-07-09T16:50:38Z |
dc.date.available |
2008-07-09T16:50:38Z |
dc.date.created |
2006-11 |
dc.date.issued |
2006-11 |
dc.identifier.uri |
http://hdl.handle.net/2072/9069 |
dc.format.extent |
21 |
dc.format.extent |
201070 bytes |
dc.format.mimetype |
application/pdf |
dc.language.iso |
eng |
dc.publisher |
Centre de Recerca Matemàtica |
dc.relation.ispartofseries |
Prepublicacions del Centre de Recerca Matemàtica;722 |
dc.rights |
Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat i el centre i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús (http://creativecommons.org/licenses/by-nc-nd/2.5/es/) |
dc.subject.other |
Grafs, Teoria dels |
dc.title |
Random graphs on surfaces |
dc.type |
info:eu-repo/semantics/preprint |
dc.subject.udc |
519.1 - Teoria general de l'anàlisi combinatòria. Teoria de grafs |
dc.description.abstract |
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that
the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components. |