ON t-EDGE COLORED COMPLETE GRAPH Kn OF ORDER n

A complete graph Kof order n is called a t-edge colored one if its edges can be colored by t colors. The Ramsey number n (F, …, F) of graphs F, i=1, 2, …, t, is the smallest positive integer n such that for some color i, an i-colored Fcan be found as subgraph of any t-edge colored complete graph K. When F=F=…F=K, we denote n(K,…, K) = r. Generalizing some results obtained by R. E. Greenwood and A. M. Gleason in 1955, we ob-