We investigate whether Kr-free graphs with few repetitions in the degree sequence may have independence number o(n). We settle the cases r = 3 and r ≥ 5, and give partial results for the very interesting case r = 4.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics