The chromatic profile of locally colourable graphs

<p>The classical Andrásfai-Erdős-Sós theorem considers the chromatic number of $K_{r + 1}$-free graphs with large minimum degree, and in the case $r = 2$ says that any $n$-vertex triangle-free graph with minimum degree greater than $2/5 \cdot n$ is bipartite. This began the study of the chroma...