The Cycle-Complete graph Ramsey numbers
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0404501,
title = {The Cycle-Complete graph Ramsey numbers},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0404501},
year = {2007}
}
备注
23 pages, accepted in Comb. Prob. and Comp