All Ramsey $(C_n,K_6)$ critical graphs for large $n$

Abstract

Let $G$ and $H$ be finite graphs. If for any two-coloring of the edges of a complete graph $K_n$, there is a copy of $G$ in the first color, red, or a copy of $H$ in the second color, blue, we will say $K_n\to (G,H)$. The Ramsey number $r(G,H)$ is defined as the smallest positive integer $n$ such that $K_n\to (G,H)$. A two-coloring of $K_{r(G,H)-1}$ such that $K_{r(G,H)-1}\nrightarrow (G,H)$ is called a critical coloring. A Ramsey critical $r(G,H)$ graph is a graph induced by the first color of a critical coloring. In this paper, when $n\ge 15$, we show that there exist exactly sixty eight non-isomorphic Ramsey critical $r(C_n,K_6)$ graphs.

arXiv comment14 pages, 4 figures

Cited by in corpus (1)

• On Star critical Ramsey numbers related to large cycles versus complete graphs