THE CYCLE-COMPLETE GRAPH RAMSEY NUMBERS R(Cn, K8), FOR 10 ≤ n ≤ 15

Given two graphs H-1 and H-2, the Ramsey number R(H-1, H-2) is the smallest natural number n such that each graph of order n contains a copy of H-1 or its complement contains a copy of H-2. In this paper, we find the exact Ramsey number R(C-n, K-8) for 10 <= n <= 15, where C-n is the cycle on n vertices and K8 is the complete graph of order 8.