On the restricted size Ramsey number for a pair of cycles

Abstract

For graphs $H_1,H_2$ by $r^{\ast }(H_1,H_2)$ we denote the minimum number of edges in a graph $G$ on $r(H_1,H_2)$ vertices such that $G\to (H_1,H_2)$. We show that for each pair of natural numbers $k,n$, $k\le n$, where $k$ is odd and $n$ is large enough, we have $$r^{\ast }(C_n,C_k)=\lceil (n+1)(2n-1)/2\rceil .$$