中文摘要：

用r种颜色对图G的所有边着色,记着第i色的边构成的子图为Gi,如果存在一种着色方法使得每一个Gi（1≤i≤r）都不包含图H,则称图G对于H可以r着色.拉姆塞数Rr（H）是使得完全图Kn对于H不可以r着色的最小正整数n.令Cm表示长度为m的圈,Dzido等证明了R3（C2k）≥4k.本文对k=4的情形进行研究,利用计算机,通过大量的计算证明了R3（C8）=16.

英文摘要：

Let Gi be the subgraph of G whose edges are in the i-th color in an r-coloring of the edges of a graph G.If there exists an r-coloring of the edges of a graph G such that H■Gi for all 1≤i≤r,then G is said to be r-colorable to H.The multicolor Ramsey number Rr（H） is the smallest integer n such that Kn is not r-colorable to H.Let Cm be a cycle of length m,Dzido et. al proved that R3（C2k）≥4k.The case that k=4 is studied in this paper.With the help of a computer,the value of R3（C8） is determined to be 16.