Multicolor Ramsey Numbers for Paths and Cycles
Multicolor Ramsey Numbers for Paths and Cycles
For given graphs G1;G2;:::;Gk;k ‚ 2, the multicolor Ramsey number R(G1;G2;:::;Gk) is the smallest integer n such that if we arbi- trarily color the edges of the complete graph on n vertices with k colors, then it is always a monochromatic copy of some Gi, for 1 • ik. We …