The evolution of uniform random planar graphs (Q2380439)

A random graph is selected according to a uniform distribution over the set of planar graphs on \(\{1,\dots,n\}\) with \(m=m(n)\) edges. The probability \(P\) is investigated that the random planar graph will have a connected component isomorphic to some fixed specified graph \(H\). Also the probability \(P'\) that the random planar graph will contain a subgraph isomorphic to \(H\) is investigated. Asymptotic results for \(P\) and \(P'\) are given for different behaviour of the ratio m/n as n tends to infinity and for \(H\) specified arbitrary or as a tree.