, Volume 21, Issue 2, pp 199-209

On Bipartite Graphs with Linear Ramsey Numbers

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.

Received December 1, 1999
ID="*" Supported by NSF grant DMS-9704114
ID="**" Supported by KBN grant 2 P03A 032 16