The random planar graph process

  • Gerke S
  • Schlatter D
  • Steger A
 et al. 
  • 15


    Mendeley users who have this article in their library.
  • 10


    Citations of this article.


We consider the following variant of the classical random graph process introduced by Erds and Rényi. Starting with an empty graph on n vertices, choose the next edge uniformly at random among all edges not yet considered, but only insert it if the graph remains planar. We show that for all ε 0, with high probability, θ(n2) edges have to be tested before the number of edges in the graph reaches (1 ε)n. At this point, the graph is connected with high probability and contains a linear number of induced copies of any fixed connected planar graph, the first property being in contrast and the second one in accordance with the uniform random planar graph model. 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008

Author-supplied keywords

  • Graph process
  • Random planar graph

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free