A construction for Ramsey numbers for Km,n

Let integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors. Using an algebraic construction it is shown that rk(Km,n)≥km(n−n0.525) for large n.