3 problems

A graph $H$ is weakly $K_k$-Turán-good when, for all sufficiently large $n$, some complete $(k-1)$-partite graph attains ${\mathrm{ex}}(n,H,K_k)$. An edge of a graph $F$ is color-c…

A graph $H$ is $K_3$-Turán-good when, for all sufficiently large $n$, the Turán graph with two parts attains ${\mathrm{ex}}(n,H,K_3)$. The Grzesik–Győri–Salia–Tompkins conjecture.…

A graph $H$ is $k$-Turán-good when, for all sufficiently large $n$, the Turán graph with $k-1$ parts attains ${\mathrm{ex}}(n,H,K_k)$. The Grzesik–Győri–Salia–Tompkins conjecture.…