crossing lemma

The crossing number of a graph (http://planetmath.org/Graph) $G$ with $n$ vertices (http://planetmath.org/Graph) and $m\ge 4n$ edges (http://planetmath.org/Graph) is

$$\mathrm{cr}(G)\ge \frac{1}{64}\frac{m^3}{n^2}.$$