3-colored asymmetric bipartite Ramsey number of connected matchings and cycles

Zhidan Luo, Yuejian Peng

Let $k,l,m$ be integers and $r(k,l,m)$ be the minimum integer $N$ such that for any red-blue-green coloring of $K_{N,N}$, there is a red matching of size at least $k$ in a componen…