Beineke and Schwenk [1] have defined the bipartite Ramsey number R(m,n), for integers m, n (1≤m≤n ), to be the smallest integer p such that any 2-colouring of the edges of the complete bipartite graph K_{p, v} forces the appearance of a monochromatic K_{m, n}. In [1] the following results are established:with equality if there is a Hadamard matrix of order 2(n−1), n odd,if there is a Hadamard matrix of order 4(n−1),