Large minors in graphs with given independence number

A weakening of Hadwiger’s conjecture states that every n -vertex graph with independence number α has a clique minor of size at least n α . Extending ideas of Fox (2010) [6], we prove that such a graph has a clique minor with at least n ( 2 − c ) α vertices where c > 1 / 19.2 .