On the Ramsey-Turán number with small $s$-independence number

Patrick Bennett, Andrzej Dudek

Let $s$ be an integer, $f=f(n)$ a function, and $H$ a graph. Define the Ramsey-Turán number $R{T}_s(n,H,f)$ as the maximum number of edges in an $H$-free graph $G$ of order $n$ with…