Ramsey numbers for bipartite graphs with small bandwidth

• DOI: 10.1016/j.ejc.2015.02.018
• Publication Date: 2015-03-09T11:32:20Z
• Authors: G.O. Mota; G.N. Sárközy; M. Schacht; A. Taraz
• Keywords: FOS: Mathematics; Mathematics - Combinatorics; Combinatorics (math.CO); 05C55 (primary), 05C38 (secondary); 0101 mathematics; 01 natural sciences

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.