加载中…
2004-04-27
The Cycle-Complete graph Ramsey numbers
Vladimir Nikiforov
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本