Articles
DeBiasio and Krueger showed the following result: For all $0\leq\delta\leq1$ and $\epsilon>0$, there exists $n_0$ such that if $G$ is a balanced bipartite graph on $2n\geq2n_0$ vertices with $\delta(G)=\delta n$, then in every $2$-coloring of G, there exists a monochromatic cycle of order at least $(f(\delta)-\epsilon)n$, where \[f(\delta)=\begin{cases} \delta, & 0\leq\delta\leq\dfrac{2}{3}, \\[3mm] 4\delta-2, & \dfrac{2}{3}<\delta\leq\dfrac{3}{4}, \\[3mm] 1, & \dfrac{3}{4}<\delta\leq1. \end{cases}\] Zhang and Peng (2023) extended the above result to off-diagonal cases when $\delta>\frac{3}{4}$. In this paper, we relax the condition $\delta>\frac{3}{4}$ to $\delta>\frac{2}{3}$. We show the following result: For every $\eta>0$, there exists a positive integer $N_0$ such that for every integer $N>N_0$ the following holds. Let $\frac{2}{3}<\delta\leq\frac{3}{4}$, and let $\alpha_1\geq\frac{\delta \alpha_2}{3\delta-2}>0$ such that $\alpha_1+\alpha_2=1$. Let $G[X, Y]$ be a balanced bipartite graph on $2N$ vertices with $\delta(G)=(\delta+3\eta)N$. Then for each red-blue-edge-coloring of $G$, either there exist red even cycles of each length in $\{4, 6, 8, \dots, 2(2\delta-1)(2-3\eta^2)\alpha_1N\}$, or there exist blue even cycles of each length in $\{4, 6, 8, \dots, 2(2\delta-1)(2-3\eta^2)\alpha_2N\}$. There are constructions of colorings showing that the length of a longest monochromatic cycle is asymptotically tight and the condition $\alpha_1\geq\frac{\delta \alpha_2}{3\delta-2}$ cannot be removed.