Minimal Graphs with Crossing Number at Least k

It is easily seen that. for each k, there is a graph G whose crossing number is at least k and an edge e of G such that G − e is planar. We show that there is a positive constant c such that, if G is a graph with crossing number k, then there exists an edge e of G such that G − e has crossing number at least ck.