Independent Sets in Graphs with an Excluded Clique Minor
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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2007-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/617 |