A logarithmic independence bound for clique-free graphs
For every integer , there is a constant depending only on such that every finite simple -free graph with vertices and average degree satisfies .
The reduction from average degree to maximum degree and the application of Proposition 6.1 are elementary and valid.
“Theorem 1.1. For every integer r ≥ 4, there is a constant cr > 0 such that every finite simple Kr-free graph G with n vertices and average degree d ≥ 2 satisfies α(G) ≥ cr n log d / d.” · Show in paper