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}.$$

Title	crossing lemma
Canonical name	CrossingLemma
Date of creation	2013-03-22 13:20:37
Last modified on	2013-03-22 13:20:37
Owner	bbukh (348)
Last modified by	bbukh (348)
Numerical id	6
Author	bbukh (348)
Entry type	Theorem
Classification	msc 05C10
Related topic	PlanarGraph