The Cycle-Complete graph Ramsey numbers
classification
🧮 math.CO
keywords
graphcompletecycleorderramseyconfirmsconjecturecycle-complete
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.