A note on independent sets in graphs with large minimum degree and small cliques
Summary: Graphs with large minimum degree containing no copy of a clique on \(r\) vertices (\(K_r\)) must contain relatively large independent sets. A classical result of \textit{B. Andrásfai} et al. [Discrete Math. 8, 205--218 (1974; Zbl 0284.05106)] implies that \(K_r\)-free graphs \(G\) with degree larger than \(((3r-7)/(3r-4))|V(G)|\) must be \((r-1)\)-partite. An obvious consequence of this result is that the same degree threshold implies an independent set of order \((1/(r-1))|V(G)|\). The following paper provides improved bounds on the minimum degree which would imply the same conclusion. This problem was first considered by Brandt, and we provide improvements over these initial results for \(r > 5\).
scientific article; zbMATH DE number 6340205