Mota, Guilherme OliveiraGuilherme OliveiraMotaSárközy, G. N.G. N.SárközySchacht, MathiasMathiasSchachtTaraz, AnuschAnuschTaraz2019-09-302019-09-302015-08-01European Journal of Combinatorics (48): 165-176 (2015-08-01)http://hdl.handle.net/11420/3474We 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.en0195-6698European journal of combinatorics2015165176Ramsey numbers for bipartite graphs with small bandwidthJournal Article10.1016/j.ejc.2015.02.018Other