Spanning Maximal Planar Subgraphs of Random Graphs

We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn, p . We show that it is very near p = 1/n⅓ We also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near p = 1/n½.

[1]  Béla Bollobás,et al.  Random Graphs , 1985 .

[2]  G. V. Balakin.  On Random Matrices , 1967 .

[3]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[4]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.