On the size-Ramsey number of grid graphs

The 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 n3+o(1).

[1]  Yoshiharu Kohayakawa,et al.  Small subsets inherit sparse epsilon-regularity , 2007, J. Comb. Theory, Ser. B.

[2]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[3]  Yoshiharu Kohayakawa,et al.  The size-Ramsey number of trees , 1995 .

[4]  Yoshiharu Kohayakawa,et al.  Szemerédi’s Regularity Lemma and Quasi-randomness , 2003 .

[5]  Yoshiharu Kohayakawa,et al.  The size‐Ramsey number of powers of paths , 2017, J. Graph Theory.

[6]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[7]  P. Erdos,et al.  The size Ramsey number , 1978 .

[8]  Vojtech Rödl,et al.  On Size Ramsey Numbers of Graphs with Bounded Degree , 2000, Comb..

[9]  Andrzej Dudek,et al.  On some Multicolor Ramsey Properties of Random Graphs , 2016, SIAM J. Discret. Math..

[10]  Joel Friedman,et al.  Expanding graphs contain all small trees , 1987, Comb..

[11]  Yoshiharu Kohayakawa,et al.  Sparse partition universal graphs for graphs of bounded degree , 2011 .

[12]  D. Conlon,et al.  Size Ramsey numbers of triangle-free graphs with bounded degree , 2016 .

[13]  Yoshiharu Kohayakawa,et al.  The size‐Ramsey number of powers of paths , 2017, J. Graph Theory.

[14]  Y. Kohayakawa,et al.  Blow-up lemmas for sparse graphs , 2016, 1612.00622.

[15]  V. Rödl,et al.  On graphs with small subgraphs of large chromatic number , 1985, Graphs Comb..

[16]  József Beck,et al.  On size Ramsey number of paths, trees, and circuits. I , 1983, J. Graph Theory.

[17]  Y. Kohayakawa.  Szemerédi's regularity lemma for sparse graphs , 1997 .

[18]  Yoshiharu Kohayakawa,et al.  The Induced Size-Ramsey Number of Cycles , 1995, Combinatorics, Probability and Computing.

[19]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[20]  Ramin Javadi,et al.  On the Size-Ramsey Number of Cycles , 2019, Comb. Probab. Comput..

[21]  Andrzej Dudek,et al.  An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths , 2015, Comb. Probab. Comput..

[22]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[23]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[24]  Yoshiharu Kohayakawa,et al.  Regular pairs in sparse random graphs I , 2003, Random Struct. Algorithms.

[25]  Yoshiharu Kohayakawa,et al.  Small subsets inherit sparse ε-regularity , 2004 .

[26]  Paul Erdös,et al.  On the combinatorial problems which I would most like to see solved , 1981, Comb..

[27]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[28]  Béla Bollobás,et al.  Random Graphs , 1985 .

[29]  Shoham Letzter.  Path Ramsey Number for Random Graphs , 2016, Comb. Probab. Comput..

[30]  Domingos Dellamonica.  The size-Ramsey number of trees , 2012, Random Struct. Algorithms.