On some three-color Ramsey numbers for paths

摘要

For graphs G(1), G(2), G(3), the three-color Ramsey number R(G(1), G(2), G(3)) is the smallest integer n such that if we arbitrarily color the edges of the complete graph of order n with 3 colors, then it contains a monochromatic copy of G(i) in color i, for some 1 <= i <= 3.