TY - JOUR
T1 - A note on some Ramsey numbers R(Cp,Cq, Cr)
AU - Tse, Kung Kuen
PY - 2007/8
Y1 - 2007/8
N2 - The Ramsey number R(Cp, Cq, Cr) is the smallest positive integer m such that no matter how one colors the edges of the Km in red, white and blue, there must be a red Cp, a white Cq or a blue Cr. In this work, we verified some known R(Cp, Cq, Cr)'s and compute some new R(Cp, Cq, Cr)'s. The results are based on computer algorithms.
AB - The Ramsey number R(Cp, Cq, Cr) is the smallest positive integer m such that no matter how one colors the edges of the Km in red, white and blue, there must be a red Cp, a white Cq or a blue Cr. In this work, we verified some known R(Cp, Cq, Cr)'s and compute some new R(Cp, Cq, Cr)'s. The results are based on computer algorithms.
UR - http://www.scopus.com/inward/record.url?scp=77957673197&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:77957673197
SN - 0835-3026
VL - 62
SP - 189
EP - 192
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
ER -