Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
1Departament de Matemàtica Aplicada II (Universitat Politècnica de Catalunya (UPC) Edifici Omega, Campus Nord Jordi Girona, 1-3 E-08034 Barcelona Spain - Spain)
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.
David R. Wood. Independent sets in graphs with an excluded clique minor. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, Vol. 9 no. 1 (1), pp.171--175. ⟨10.46298/dmtcs.385⟩. ⟨hal-00966507⟩