\(R(C_6,K_5)=21\) and \(R(C_7,K_5)=25\) (Q5942877)

In 1976 \textit{R. J. Faudree} and \textit{R. H. Schelp} [Theor. Appl. Graphs, Proc. Kalamazoo 1976, Lect. Notes Math. 642, 500-515 (1978; Zbl 0375.05032)] conjectured that the graph Ramsey number of cycles versus complete graphs satisfies \(R(C_n,K_m)=(n-1)(m-1)+1\) as long as \(n\geq m\geq 3\) and \(m,n\) are not both 3. Earlier \textit{J. A. Bondy} and \textit{P. Erdős} [J. Comb. Theory, Ser. B 14, 46-54 (1973; Zbl 0248.05127)] had already shown that this equality holds for \(n\geq m^2-2\), and the conjecture has been verified for the cases \(n\geq m=3\) and \(n\geq m=4\). Recently the authors of the paper under review have, in joint work with \textit{B. Bollobás}, \textit{C. Jayawardene} and \textit{C. Rousseau} [Australas. J. Comb. 22, 63-71 (2000; Zbl 0963.05094)] also proved the conjecture for \(n\geq m=5\). The current paper is concerned with the special cases \((n,m)=(6,5)\) (which is also contained in [\textit{C. J. Jayawardene} and \textit{C. C. Rousseau}, Congr. Numerantium 136, 147-159 (1999; Zbl 0965.05074)]) and \((n,m)=(7,5)\), so that the paper contains no new insights. Recent results on Ramsey numbers can be found in the dynamic survey of \textit{S. P. Radziszowski} [Electron. J. Comb. Spec. Iss., Research paper DS1 (1996; Zbl 0953.05048)].