Every graph is eventually Turán-good

Abstract

Let $H$ be a graph. We show that if $r$ is large enough as a function of $H$, then the $r$-partite Turán graph maximizes the number of copies of $H$ among all $K_{r+1}$-free graphs on a given number of vertices. This confirms a conjecture of Gerbner and Palmer.

Cited by in corpus (1)

• Stability from graph symmetrization arguments in generalized Turán problems