On a Question of Erdös and Faudree on the Size Ramsey Numbers
On a Question of Erdös and Faudree on the Size Ramsey Numbers
For given simple graphs $G_1$ and $G_2$, the size Ramsey number $\hat{R}(G_1,G_2)$ is the smallest positive integer $m$, where there exists a graph $G$ with $m$ edges such that in any edge coloring of $G$ with two colors red and blue, there is either a red copy of $G_1$ or …