Exact Values for Some Size Ramsey Numbers of Paths and Cycles
Exact Values for Some Size Ramsey Numbers of Paths and Cycles
Exact values for some sFor graphs $G_1$, $G_2$ and $G$, if every 2-coloring (\emph{red} and \emph{blue}) of the edges of $G$ results in either a copy of \emph{blue} $G_1$ or a copy of \emph{red} $G_2$, we write $G \rightarrow (G_1, G_2)$. The size Ramsey number $\hat{R}(G_1, G_2)$ is the smallest …