摘要
A complete graph Kn of order n is called a t-edge colored one if its edges can be colored by t colors. The Ramsey number n （Fl, …, Ft） of graphs Fi, i=1, 2, …, t, is the smallest positive integer n such that for some color i, an i-colored Fi can be found as subgraph of any t-edge colored complete graph Kn. When F1=F2=…Ft=K3, we denote n（K3,…, K3） = rt. Generalizing some results obtained by R. E. Greenwood and A. M. Gleason in 1955, we ob-
