Crossing Lemma - Part I35 Crossing number and monotone property proof: We will use a slightly different version of the bisection width lower bound: Let G be a graph of n vertices, whose degrees are d 1,..., dn Then: Will be used without a proof