%0 Journal Article
%T Independent Sets in Graphs with an Excluded Clique Minor
%A David R. Wood
%J Discrete Mathematics & Theoretical Computer Science
%D 2007
%I Discrete Mathematics & Theoretical Computer Science
%X 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.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/617