A new lower bound on the independence number of a graph

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/131979For a given connected graph G on n vertices and m edges, we prove that its independence number is at least (2m+n+2-sqrt(sqr(2m+n+2)-16sqr(n)))/8.4 pagesDiscrete MathematicsF.2.2A new lower bound on the independence number of a graphtext