Ramsey-Turán numbers for intersecting odd cliques

Min Liu

Given a graph $H$ and a function $f:{\mathbb{Z}}^{+}⟶{\mathbb{Z}}^{+}$, the Ramsey-Turán number of $H$ and $f$, denoted by $RT(n,H,f(n))$, is the maximum number of edges…