| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
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.
Cited literature [20 references]
https://hal.inria.fr/hal-00966507
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 26, 2014 - 4:59:24 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, June 26, 2014 - 11:56:11 AM
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 26, 2014 - 4:59:24 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, June 26, 2014 - 11:56:11 AM
File
617-2510-1-PB.pdf
Files produced by the author(s)