Independent Sets in Graphs with an Excluded Clique Minor

Abstract

Let G be a graph with n vertices, with independence number α, and with no K t+1-minor for some t ≥ 5. It is proved that (2α - 1)(2t - 5) ≥ 2n - 5.