Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Combinatorial Mathematics and Combinatorial Computing
Paper Title
Journal
Date
