Author:
Clemens Dennis,Miralaei Meysam,Reding Damian,Schacht Mathias,Taraz Anusch
Abstract
AbstractThe 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).
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the size-Ramsey number of grids;Combinatorics, Probability and Computing;2023-06-26
2. Three Early Problems on Size Ramsey Numbers;Combinatorica;2023-05-02
3. The Turán number of the grid;Bulletin of the London Mathematical Society;2022-09-08
4. The size‐Ramsey number of cubic graphs;Bulletin of the London Mathematical Society;2022-05-26