Let be the number of crossings in the drawing, placed in general position. Deleting at most one edge at each crossing leaves a planar graph, so the Euler formula for a connected planar graph gives
Now retain every vertex independently with probability , together with every edge whose endpoints survive. The expected numbers of retained vertices, edges and crossings are . Applying the preceding inequality to each sampled drawing and taking expectations gives
Because , choose . Then
and therefore
Thus the Crossing lemma holds here with the absolute constant .

Articles by others on the same topic (0)

There are currently no matching articles.