1 Introduction Random planar graphs have recently been the subject of much activity, and many pro erties of the standard random planar graph Pn (taken uniformly at random from the s of all planar graphs on { 1, 2, . , n} ) are now known. For example, in [7] it was show that Pn will asymptotically almost surely (a.a.s., that is, with probability tending to 1 n tends to infinity) contain at least linearly many copies of any given planar graph. B combining the counting methods of [7] with some rather precise results of [5], obtained u ing generating functions, the exact limiting probability for the event that Pn will conta any given component is also known.
