Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree

Yiran Zhang, Yuejian Peng

For graphs $G_0$, $G_1$ and $G_2$, write $G_0⟼(G_1,G_2)$ if each red-blue-edge-coloring of $G_0$ yields a red $G_1$ or a blue $G_2$. The Ramsey number $r(G_1,G_2)$ is t…