The-proper-Ramsey-numbers-of- K 3 -against- C 3 -and- C 5
The-proper-Ramsey-numbers-of- K 3 -against- C 3 -and- C 5
For graphs F and H, the proper Ramsey Number PR(F,H) is the smallest integer n so that any χ′(H)-edge-coloring on Kn contains either a monochrome F or a properly colored H. We determine the proper Ramsey number of K3 against C3 and C5.