Paths are Turán-good

Abstract

We show that among $K_{k+1}$-free $n$-vertex graphs, the Turán graph contains the most copies of any path.