David R. Wood - Independent sets in graphs with an excluded clique minor

dmtcs:385 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 1 - https://doi.org/10.46298/dmtcs.385
Independent sets in graphs with an excluded clique minor

Authors: David R. Wood ORCID-iD1

  • 1 Departament de Matemàtica Aplicada II

Let G be a graph with n vertices, with independence number α, and with no Kt+1-minor for some t ≥ 5. It is proved that (2α - 1)(2t - 5) ≥ 2n - 5. This improves upon the previous best bound whenever n≥2/5t2.

https://doi.org/10.46298/dmtcs.385
Source: HAL:hal-00966507v1
Volume: Vol. 9 no. 1
Section: Graph and Algorithms
Published on: January 1, 2007
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 1810.03306
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1810.03306
  • 10.48550/arxiv.1810.03306
  • 1810.03306
Complete minors and stability numbers

Share and export

Consultation statistics

This page has been seen 235 times.
This article's PDF has been downloaded 277 times.