Thickness of G when G is a simple connected graph

867 Views Asked by At

The thickness of a simple graph G is the smallest number of planar subgraphs of G that have G as their union.

Show that if G is a connected simple graph with v vertices and e edges, where v ≥ 3, then the thickness of G is at least ⎡e/(3(v)-6)⎤.

I am not sure where to even start on this...