Two types of size Ramsey numbers for matchings of small order

Valentino Vito, Denny Riama Silaban

For simple graphs $G$ and $H$, their size Ramsey number $\hat{r}(G,H)$ is the smallest possible size of $F$ such that for any red-blue coloring of its edges, $F$ contains either a…