on the bipartite ramsey number br(c6,c6,mk2)

for given bipartite graphs g₁,g₂, ...,g_t, the multicolor bipartite ramsey number br(g₁,g₂, ...,g_t) is the smallest positive integer b such that if the edges of the complete bipartite graph k_b,b are partitioned into t disjoint color classes giving t graphs h₁,h₂, ...,h_t then at least one h_i, 1 ≤ i ≤ t has a subgraph isomorphic to g_i. in this paper, the exact value of the bipartite ramsey number br(c₆,c₆,mk₂) is provided for m ³ 5.