On globally sparse Ramsey graphs

Torsten Mütze, Ueli Peter

We say that a graph $G$ has the Ramsey property w.r.t.\ some graph $F$ and some integer $r\ge 2$, or $G$ is $(F,r)$-Ramsey for short, if any $r$-coloring of the edges of $G$ conta…