Date of Original Version

6-24-2013

Type

Article

Rights Management

© Cambridge University Press

Abstract or Description

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.

DOI

10.1017/S0963548313000308

Included in

Mathematics Commons

Share

COinS
 

Published In

Combinatorics, Probability and Computing, 22, 5, 722-732.