file.pdf (262.83 kB)

On the Non-Planarity of a Random Subgraph

Download (262.83 kB)
journal contribution
posted on 24.06.2013, 00:00 by Alan Frieze, Michael Krivelevich

Let G be a finite graph with minimum degree r. Form a random subgraph Gp of G by taking each edge of G into Gpindependently and with probability p. We prove that for any constant ε > 0, if , then Gp is non-planar with probability approaching 1 as r grows. This generalizes classical results on planarity of binomial random graphs.

History

Publisher Statement

© Cambridge University Press

Date

24/06/2013

Usage metrics

Exports