The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\) (Q643174)

Summary: It has been conjectured by \textit{P. Erdős} et al. [J. Graph Theory 2, 53--64 (1978; Zbl 0383.05027)] that \(r(C_m, K_n) = (m - 1)(n - 1) + 1\) for all \((m, n) \neq (3, 3)\) satisfying that \(m \geq n \geq 3\) (except \(r(C_3, K_3) = 6\)). In this paper, we prove this for the case \(m = 9\) and \(n = 8\).