On (t - 1)-colored paths in t-colored complete graphs.

Given t distinct colors, we order the t subsets of t - 1 colors in some arbitrary manner. Let G1, G2, . . ., Gt be graphs. The (t - 1)-chromatic Ramsey number, denoted by γt t-1(G1, G2, . . ., Gt), is defined to be the least number n such that if the edges of the complete graph Kn are colored in any fashion with t colors, then for some i the subgraph whose edges are colored with the ith subset of colors contains a Gi. In this paper, we find the value of γ5 4(G1, . . ., G5) when each Gi is a path. [ABSTRACT FROM AUTHOR]