On the non-planarity of a random subgraph

preprint2013arXivOpen access

Abstract

Let GG be a finite graph with minimum degree rr. Form a random subgraph GpG_p of GG by taking each edge of GG into GpG_p independently and with probability pp. We prove that for any constant ε>0ε>0, if p=1+εrp=\frac{1+ε}{r}, then GpG_p is non-planar with probability approaching 1 as rr grows. This generalizes classical results on planarity of binomial random graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.