Two Ramsey problems in blowups of graphs

António Girão, Robert Hancock

Given graphs $G$ and $H$, we say $G\stackrel{r}{\to }H$ if every $r$-colouring of the edges of $G$ contains a monochromatic copy of $H$. Let $H[t]$ denote the $t$-blowup of $H$. T…