Clemens, DennisDennisClemensMiralaei, MeysamMeysamMiralaeiReding, DamianDamianRedingSchacht, MathiasMathiasSchachtTaraz, AnuschAnuschTaraz2021-11-252021-11-252021-09Combinatorics Probability and Computing 30 (5): 670-685 (2021-09)http://hdl.handle.net/11420/11074The size-Ramsey number of a graph F is the smallest number of edges in a graph G with the Ramsey property for F, that is, with the property that any 2-colouring of the edges of G contains a monochromatic copy of F. We prove that the size-Ramsey number of the grid graph on n × n vertices is bounded from above by n 3+o(1).en0963-548320215670685Journal Article10.1017/S0963548320000322Journal Article