A general bound on $R(C_k,H)$

Abstract

In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R(C_k,H)$ is at most $(k-1)m+1\le km$. This settles a problem of Erdős, Faudree, Rousseau and Schelp, which is listed as problem 34 in the graph theory collection.

7 Pages, 1 figure (3 subfigures)