A Note on a Lower Bound for r(Km,n)

Abstract:

Let G be a graph. The Ramsey number r(G) is the minimum integer N such that any two edge-coloring of K_N contains a monochromatic G. Using an algebraic construction it is shown that r(Km,n)>= 2^m(n- n^{0.525}) for large n.