Independent sets in graphs with an excluded clique minorReport as inadecuate




Independent sets in graphs with an excluded clique minor - Download this document for free, or read online. Document in PDF available to download.

1 Departament de Matemàtica Aplicada II

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α - 12t - 5 ≥ 2n - 5. This improves upon the previous best bound whenever n≥2-5t2.





Author: David Wood -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents