 Crossing lemma

If a simple graph has $n$ vertices and $e\ge 4n$ edges, every plane drawing has at leastcrossings. Apply the linear planar bound to the random induced subgraph obtained by retaining vertices independently with probability $4n/e$.