Two Ramsey problems in blowups of graphs

Given graphs G and H, we say G r→ 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. The blowup Ramsey number B(G r→ H;t) is the minimum n such that G[n] r→ H[t]. Fox, Luo and Wigderson refined an upper bound of Souza, showing that, given...