On Some Three-Color Ramsey Numbers for Paths

Janusz Dybizbański, Tomasz Dzido, Stanisław Radziszowski

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 orde…