Independent sets in graphs with an excluded clique minor - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2007

Independent sets in graphs with an excluded clique minor

Abstract

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.
Fichier principal
Vignette du fichier
617-2510-1-PB.pdf (94.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00966507 , version 1 (26-03-2014)

Identifiers

Cite

David R. Wood. Independent sets in graphs with an excluded clique minor. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 1 (1), pp.171--175. ⟨10.46298/dmtcs.385⟩. ⟨hal-00966507⟩

Collections

TDS-MACS
35 View
746 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More