The Ramsey number for a cycle of length six versus a clique of order eight (Q1003750)

It was conjectured by \textit{P. Erdős}, \textit{R.J. Faudree}, \textit{C.C. Rousseau}, and \textit{R.H. Schelp} in [J. Graph Theory 2 , 53-64 (1978; Zbl 0383.05027)] that \(r(K_m, C_n) = (m - 1)(n - 1) + 1\) for \(3 \leq m \leq n\) and \((m,n) \neq (3,3)\), and the question was posed to find the smallest \(n\) for which this is true. It is shown that the Ramsey number \(r(K_8, C_6) = 36 = (8 - 1)(6 - 1) + 1\). The conjecture has been verified for \(m \leq 7\), and this adds to the results that support the conjecture of Erdős et.al.