On the size of $(K_t,K_{1,k})$-co-critical graphs

Hunter Davenport, Zi-Xia Song, Fan Yang

Given graphs $G,H_1,H_2$, we write $G\to (H_1,H_2)$ if every $\{$red, blue$\}$-coloring of the edges of $G$ contains a red copy of $H_1$ or a blue copy of $H_2$. A no…