DZIDO , T.

For given graphs H1, H2, H3, the 3-color Ramsey number R(H1, H2, H3) 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 always contains a monochromatic copy of Hi colored with i, for some 1 6 i 6 3. We study the bounds on 3-color Ramsey numbers R(H1, H2, H3), where...