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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.