Bipartite Ramsey problems deal with the same questions but the graph explored is the complete bipartite graph instead of the complete graph. Given bipartite graphs \(G_1, \ldots , G_n\) , the bipartite Ramsey number \(BR(G_1,\ldots , G_n)\)  is the last integer \(b\)  such that any complete bipartite graph \(K_{b,b}\)  with edges coloured with colours \(1,2,\ldots ,n\)  contains a copy of some \(G_i\)  (\(1\le i\le n\) ) where all edges of \(G_i\)  have colour \(i\) . One can refer to [1]}, [2]}, [3]}, [4]}, [5]}, [6]}, [7]}, [8]}, [9]} and their references for further studies.
