Some news about the independence number of a graph
Jochen Harant · Discussiones Mathematicae Graph Theory · 2000
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G.