Independent Sets in Graphs with an Excluded Clique Minor

preprint2006arXivOpen access

Abstract

Let GG be a graph with nn vertices, with independence number αα, and with with no Kt+1K_{t+1}-minor for some t≥5t\geq5. It is proved that (2α−1)(2t−5)≥2n−5(2α-1)(2t-5)\geq2n-5.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.