On the non-planarity of a random subgraph
Combinatorics
2013-06-25 v3
Abstract
Let be a finite graph with minimum degree . Form a random subgraph of by taking each edge of into independently and with probability . We prove that for any constant , if , then is non-planar with probability approaching 1 as 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