Name
Abstract | ||
|---|---|---|
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 x n vertices is bounded from above by n(3+o(1)). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1017/S0963548320000322 | COMBINATORICS PROBABILITY & COMPUTING |
DocType | Volume | Issue |
Journal | 30 | 5 |
ISSN | Citations | PageRank |
0963-5483 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Clemens Dennis | 1 | 18 | 8.25 |
| Miralaei Meysam | 2 | 0 | 0.34 |
| Reding Damian | 3 | 0 | 0.34 |
| Mathias Schacht | 4 | 361 | 37.90 |
| Anusch Taraz | 5 | 168 | 37.71 |