For two given graphs G1and G2, the Ramsey number R (G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1or the complement of G contains G2. Let Cmdenote a cycle of length m and Kna complete graph of order n. In this paper, it is shown that R (C6, K8) = 36.
- Complete graph
- Ramsey number
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics