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.
Source: OpenCitations
Large minors in graphs with given independence number
Discrete Mathematics
Journal reference : Volume 311, 2011, pp. 2203-2215
DOI : 10.1016/j.disc.2011.07.003Clique immersions and independence number
arXiv (Cornell University)
Journal reference : Volume 106, 2022, pp. 103550
DOI : 10.1016/j.ejc.2022.103550Biclique immersions in graphs with independence number 2
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications
Journal reference : Volume , 2023, pp. 169-177
DOI : 10.5817/cz.muni.eurocomb23-024