| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653415 | European Journal of Combinatorics | 2015 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
G.O. Mota, G.N. Sárközy, M. Schacht, A. Taraz,