Bipartite Ramsey numbers of large cycles

Shaoqiang Liu, Yuejian Peng

For an integer $r\ge 2$ and bipartite graphs $H_i$, where $1\le i\le r$, the bipartite Ramsey number $br(H_1,H_2,\dots ,H_r)$ is the minimum integer $N$ such that any $r$-edge c…