Liu–Ma conjecture on consecutive odd cycles

Let $G$) be a $2$-connected non-bipartite graph with minimum degree at least $k+1$.

Liu–Ma conjecture. $G$ contains $eil k/2$ cycles with consecutive odd lengths.

Liu and Ma proposed this conjecture after proving the lower bound $floor k/2$; the conjecture is sharp for the complete graph $K_{k+2}$. This paper's abstract states that the conjecture is confirmed for every $k\in\mathbb N$, so the conjecture is solved.