A Note on $K_r$-Free Graphs with Chromatic Number at least $r$

Abstract

We provide a new proof of a result of Hanson and Toft classifying the maximum-size $K_r$-free graphs on $n$ vertices with chromatic number at least $r$.