Ramsey numbers for bipartite graphs with small bandwidth

Publikationstyp
Journal Article
Date Issued
2015-08-01
Sprache
English
Author(s)
Mota, Guilherme Oliveira  
Sárközy, G. N.  
Schacht, Mathias  
Taraz, Anusch  
Institut
Mathematik E-10  
TORE-URI
http://hdl.handle.net/11420/3474
Journal
European journal of combinatorics  
Volume
48
Start Page
165
End Page
176
Citation
European Journal of Combinatorics (48): 165-176 (2015-08-01)
Publisher DOI
10.1016/j.ejc.2015.02.018
Scopus ID
2-s2.0-84924301079
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine asymptotically the two color Ramsey number for bipartite graphs with small bandwidth and bounded maximum degree and the three color Ramsey number for such graphs with the additional assumption that the bipartite graph is balanced.
More Funding Information
A. Taraz was supported in part by DFG grant TA 309/2-2