The Cycle-Complete Graph Ramsey Numbers

From MaRDI portal
Publication:4680573




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 ErdH{o}s, Faudree, Rousseau, and Schelp made in 1978.









This page was built for publication: The Cycle-Complete Graph Ramsey Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680573)