English

On the non-planarity of a random subgraph

Combinatorics 2013-06-25 v3

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\epsilon>0, if p=1+ϵrp=\frac{1+\epsilon}{r}, then GpG_p is non-planar with probability approaching 1 as rr grows. This generalizes classical results on planarity of binomial random graphs.

Keywords

Cite

@article{arxiv.1205.6240,
  title  = {On the non-planarity of a random subgraph},
  author = {Alan Frieze and Michael Krivelevich},
  journal= {arXiv preprint arXiv:1205.6240},
  year   = {2013}
}

Comments

Final version