Published August 16, 2023
| In Press
Journal Article
Open
On the size-Ramsey number of grids
- Creators
-
Conlon, David
- Nenadov, Rajko
-
Trujić, Miloš
Abstract
We show that the size-Ramsey number of the √n × √n grid graph is O(n^(5/4)), improving a previous bound of n^(3/2 + o(1)) by Clemens, Miralaei, Reding, Schacht, and Taraz.
Additional Information
© The Author(s), 2023. Published by Cambridge University Press. This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited. David Conlon: Research supported by NSF Award DMS-2054452. Miloš Trujić: Research supported by grant no. 200020 197138 of the Swiss National Science Foundation.Attached Files
In Press - on-the-size-ramsey-number-of-grids.pdf
Files
on-the-size-ramsey-number-of-grids.pdf
Files
(344.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:9355d60b0855294307849b006bd3707b
|
344.3 kB | Preview Download |
Additional details
- Eprint ID
- 122337
- Resolver ID
- CaltechAUTHORS:20230717-55915200.33
- DMS-2054452
- NSF
- 200020 197138
- Swiss National Science Foundation (SNSF)
- Created
-
2023-08-16Created from EPrint's datestamp field
- Updated
-
2023-08-16Created from EPrint's last_modified field