On the multicolor Ramsey number of a graph with m edges

Kathleen Johst, Yury Person

The multicolor Ramsey number $r_k(F)$ of a graph $F$ is the least integer $n$ such that in every coloring of the edges of $K_n$ by $k$ colors there is a monochromatic copy of $F$.…