(Minors) Let G be a graph with n 2 vertices and m edges. Suppose that G contains neither K4 nor K2,3 as a minor. Prove that m 2n 3. k for complete graph.

Hint: Construct a graph G from G by adding a new vertex adjacent to every vertex of G.