The Extremal Function for Complete Minors

Let c(t) be the minimum number c such that every graph G with e(G)⩾c |G| contracts to a complete graph Kt. We show thatc(t)=(α+o(1)) t log twhere α=0.319... is an explicit constant. Random graphs are extremal graphs.