Carnegie Mellon University
Browse

Spanning maximal planar subgraphs of random graphs

Download (689.82 kB)
journal contribution
posted on 1990-01-01, 00:00 authored by Béla Bollobás, Frieze
Abstract: "We study the threshold for the existence of a spanning maximal planar subgraph in the random graph G[subscript n,p]. We show that it is very near p = 1[over][subscript n]1/3. We also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near p = 1[over][subscript n]1/2."

History

Publisher Statement

All Rights Reserved

Date

1990-01-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC