Let G be a regular graph of degree d on n points which contains no K r ( r ≥ 4). Let α be the independence number of G . Then we show for large d that α ≥ c(r)n .
No takes yet. Share an insight, caveat, or question.
James B. Shearer (1995) studied this question.