Ramsey-Turán Problems with small independence numbers

József Balogh, Ce Chen, Grace McCourt +1

Given a graph $H$ and a function $f(n)$, the Ramsey-Turán number $RT(n,H,f(n))$ is the maximum number of edges in an $n$-vertex $H$-free graph with independence number at most $f(n…