On the size of $(K_t,{\mathcal{T}}_k)$-co-critical graphs

Zi-Xia Song, Jingmei Zhang

Given an integer $r\ge 1$ and graphs $G,H_1,\dots ,H_r$, we write $G\to (H_1,\dots ,H_r)$ if every $r$-coloring of the edges of $G$ contains a monochromatic copy o…