Size Ramsey numbers of small graphs versus fans or paths

Yufan Li, Yanbo Zhang, Yunqing Zhang

For two graphs $G_1$ and $G_2$, the size Ramsey number $\hat{r}(G_1,G_2)$ is the smallest positive integer $m$ for which there exists a graph $G$ of size $m$ such that for any red-…