Connected size Ramsey numbers of matchings versus a small path or cycle

Sha Wang, Ruyu Song, Yixin Zhang +1

Given two graphs $G_1,G_2$, the connected size Ramsey number ${\hat{r}}_c(G_1,G_2)$ is defined to be the minimum number of edges of a connected graph $G$, such that for any red-bl…