Three color Ramsey numbers for graphs with at most 4 vertices

Luis Boza, Janusz Dybizba´nski, Dybizba´nski Dzido
unpublished
For given graphs H 1 , H 2 , H 3 , the 3-color Ramsey number R(H 1 , H 2 , H 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 always contains a monochromatic copy of H i colored with i, for some 1 i 3.
fatcat:yozv2om4njga7ck2dwtd6bgyyy