Options
On the size-Ramsey number of grid graphs
Publikationstyp
Journal Article
Publikationsdatum
2021
Sprache
English
Institut
Enthalten in
Start Page
1
End Page
16
Citation
Combinatorics Probability and Computing : 1-16 (2021) (in press; CC BY 4.0)
Publisher DOI
Scopus ID
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 n 3+o(1).