摘要
研究了素数阶完全图Ｋｐ的边的ｎ－染色，给出了计算它的子图Ｇｐ（Ｓｉ）的团数的一种算法，得到２个三色，４个四色Ｒａｍｓｅｙ数的新的下界。
The n colour of the edges of prime order complete graphs K p is studied. An algorithm for computing the clique numbers of the subgraphs G p(S i) of K p is developed. New lower bounds of two 3 colour and four 4 colour Ramsey numbers were obtained as follows:R(3,4,16) 354,R(3,4,17) 434,R(3,3,5,16) 1 094,R(3,3,5,17) 1 250,R(3,3,6,15) 1 218,R(3,4,5,15) 1 302.
出处
《吉林工学院学报（自然科学版）》
CAS
1999年第2期46-50,共5页
Journal of Jilin Institute of Technology
基金
广西科学基金
