New bounds for some small multicolor Ramsey numbers

William J. Wesley

The Ramsey number $R(G_1,\dots ,G_k)$ is the smallest $n$ such that every $k$-coloring of the edges of $K_n$ contains a monochromatic copy of $G_i$ in color $i$. Ramsey numbers are…