Complete graph minor density threshold
= Complete graph minor density threshold
{title2=$c(t)$}
The complete graph minor density threshold is
$$
c(t)=\inf\{c:\text{every nonempty finite graph }G\text{ with }e(G)\geq c|G|\text{ has a }K_t\text{ minor}\}.
$$
The density here is <edge> count divided by order, half the average <degree of a vertex>. For large $t$, this threshold has order $t\sqrt{\log t}$, with the logarithm taken to base $e$.