Hwang's odd-cycle packing conjecture

Let $G$ be a graph, and let $k\geq 2$ and odd $r\geq 3$ be integers.

Hwang's odd-cycle packing conjecture. If $G$ has at least $rk$ vertices and minimum degree at least

$$\tfrac{r+1}{2}k,$$

then $G$ contains $k$ disjoint cycles, each containing at least $r$ vertices.

The conjecture is one of two minimum-degree extensions attributed to Hwang. The supplied text presents it as open and explains that its degree threshold is forced by a split-graph construction.