Mathematics – Combinatorics
Scientific paper
2004-04-27
Mathematics
Combinatorics
23 pages, accepted in Comb. Prob. and Comp
Scientific paper
We find the Ramsey number of a cycle vs. a complete graph when the order of
the cycle is at least 4 times as large as the order of the complete graph. This
partially confirms a conjecture of Erd\H{o}s, Faudree, Rousseau, and Schelp
made in 1978.
No associations
LandOfFree
The Cycle-Complete graph Ramsey numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Cycle-Complete graph Ramsey numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Cycle-Complete graph Ramsey numbers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-376844