Publisher DOI: 10.1017/S0963548320000322
Title: On the size-Ramsey number of grid graphs
Language: English
Authors: Clemens, Dennis  
Miralaei, Meysam 
Reding, Damian 
Schacht, Mathias 
Taraz, Anusch 
Issue Date: 2021
Source: Combinatorics Probability and Computing : 1-16 (2021) (in press; CC BY 4.0)
Journal: Combinatorics, probability & computing 
Abstract (english): 
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).
URI: http://hdl.handle.net/11420/11074
ISSN: 0963-5483
Institute: Mathematik E-10 
Document Type: Article
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

4
checked on Nov 27, 2021

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.