Complete Minors, Independent Sets, and Chordal Graphs

Jozsef Balogh, John Lenz, Hehui Wu

The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conjecture states that h(G) >= χ(G). Since χ(G) α(G) >= |V(G)|, Hadwiger's Conjecture…