Adamus–Adamus conjecture on long cycles in balanced bipartite graphs

Let $G$ be a balanced bipartite graph of order $2n$, with minimum degree $\delta(G)\ge r\ge 1$, where $n\ge 2k+2r$ and $k\in\mathbb{Z}$. Adamus–Adamus conjecture. If

$$e(G)>n(n-k-r)+r(k+r),$$

then $G$ contains a cycle of length $2n-2k$. This is presented as the criterion proposed by Adamus and Adamus for guaranteeing a prescribed long cycle; the supplied text does not state whether it has been proved or remains open.