Journal article
Random planar graphs
- Abstract:
- We study various properties of the random planar graph Rn, drawn uniformly at random from the class Pn of all simple planar graphs on n labelled vertices. In particular, we show that the probability that Rn is connected is bounded away from 0 and from 1. We also show for example that each positive integer k, with high probability Rn has linearly many vertices of a given degree, in each embedding Rn has linearly many faces of a given size, and Rn has exponentially many automorphisms. © 2004 Elsevier Inc. All rights reserved.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 274.4KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jctb.2004.09.007
Authors
+ European Strategic Program on Research in Information Technology
More from this funder
- Funding agency for:
- McDiarmid, C
- Publisher:
- Elsevier
- Journal:
- JOURNAL OF COMBINATORIAL THEORY SERIES B More from this journal
- Volume:
- 93
- Issue:
- 2
- Pages:
- 187-205
- Publication date:
- 2005-03-01
- DOI:
- ISSN:
-
0095-8956
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2005
- Notes:
- Copyright 2004 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record