The Cycle-Complete Graph Ramsey Numbers

From MaRDI portal
Publication:4680573

DOI10.1017/S096354830400642XzbMATH Open1071.05051arXivmath/0404501OpenAlexW2015634355MaRDI QIDQ4680573FDOQ4680573


Authors: Vladimir Nikiforov Edit this on Wikidata


Publication date: 7 June 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0404501




Recommendations




Cited In (24)





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)