Redundant edges in Ramsey graphs

Ye Wang, Yusheng Li, Yan Li

For graphs $G$, $F$ and $H$, let $G\to (F,H)$ signify that any edge coloring of $G$ in red and blue contains a red $F$ or a blue $H$. The Ramsey number $R(F,H)=\min\{r|\; K…