On Bipartite Graphs with Linear Ramsey Numbers
- Cite this article as:
- Graham, R., Rödl, V. & Ruciński, A. Combinatorica (2001) 21: 199. doi:10.1007/s004930100018
Dedicated to the memory of Paul Erdős
We provide an elementary proof of the fact that the ramsey number of every bipartite graph H with maximum degree at most \(\) is less than \(\). This improves an old upper bound on the ramsey number of the n-cube due to Beck, and brings us closer toward the bound conjectured by Burr and Erdős. Applying the probabilistic method we also show that for all \(\) and \(\) there exists a bipartite graph with n vertices and maximum degree at most \(\) whose ramsey number is greater than \(\) for some absolute constant c>1.