Dense minors of graphs with independence number two

Abstract

Motivated by Hadwiger's conjecture, we prove that every graph with no independent set of size three contains a t-vertex simple minor with$0.98688\cdot \left(\begin{array}{c}t\\ 2\end{array}\right)-o\left(t^2\right)$ edges, where t is its chromatic number.