Highly Influenced

16 Excerpts

- Published 2005 in J. Comb. Theory, Ser. B

We study various properties of the random planar graph Rn, drawn uniformly at random from the classPn of all simple planar graphs on n labelled vertices. In particular, we show that the probability thatRn 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.

Showing 1-10 of 77 extracted citations

Highly Influenced

16 Excerpts

Highly Influenced

8 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

2 Excerpts

Highly Influenced

3 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

3 Excerpts

Highly Influenced

3 Excerpts

Highly Influenced

3 Excerpts

Highly Influenced

3 Excerpts

@article{McDiarmid2005RandomPG,
title={Random planar graphs},
author={Colin McDiarmid and Angelika Steger and Dominic J. A. Welsh},
journal={J. Comb. Theory, Ser. B},
year={2005},
volume={93},
pages={187-205}
}