For a graph G with n vertices and average valency t, Turán's theorem yields the inequality α≧n/(t+1) where α denotes the maximum size of an independent set in G. We improve this bound for graphs containing no large cliques.
- AMS subject classification (1980): 05C35, 05C55
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics