科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this article we study multipartite Ramsey numbers for odd cycles. Our main result is the proof that a conjecture of Gyarfas et al. (J Graph Theory 61 (2009), 1221), holds for graphs with a large enough number of vertices. Precisely, there exists n0 such that if n?n0 is a positive odd integer then any two-coloring of the edges of the complete five-partite graph K(n - 1)/2, (n - 1)/2, (n - 1)/2, (n - 1)/2, 1 contains a monochromatic cycle of length n.
- 出版日期2012-11
