Let us suppose that a graph, Gn, has no triangle and the number of its edges is 4n.

Prove that Cr(Gn) 2n.

** Use the probabilistic method to give a better bound, Cr(Gn) 2.37n.

Cr is the crossing number