Two Ramsey-Turán numbers involving triangles

Xinyu Hu, Qizhong Lin

Given integers $p,q\ge 2$, we say that a graph $G$ is $(K_p,K_q)$-free if there exists a red/blue edge coloring of $G$ such that it contains neither a red $K_p$ nor a blue $K_q$. F…