Complete Critical Ramsey Numbers of Cycle and K4 Numbers

Abstract:

For graphs G and H, Ramsey number r(G,H) is the smallest integer r such that every red/blue edge coloring of Kr contains either a red copy of G, or a blue copy of H. Complete critical Ramsey number rK(G,H) is the largest integer n such that every 2-coloring of Kr－Kn contains either a red copy of G, or a blue copy of H. When positive integer n≥5, rK(Cn,K4)=n/2, Cn is cycle with n vertices.