Let integers k and in be fixed and let r(k)(G) be the Ramsey number of the graph Gin k colors. Using an algebraic construction it is shown that r(k)(K(m,) (n)) >= k(m)(n - n(0.525)) for large n.