Independent Sets in Graphs with an Excluded Clique Minor
  Let $G$ be a graph with $n$ vertices, with independence number $\alpha$, and with with no $K_{t+1}$-minor for some $t\geq5$. It is proved that $(2\alpha-1)(2t-5)\geq2n-5$. 
David R. Wood