Gould, Horn and Magnant's chorded-cycle packing conjecture

Let $c,k$ be integers with $c\geq 2$ and $k\geq 1$. For an integer $r\geq 0$, an $r$-chorded cycle is a cycle with $r$ chords. Gould, Horn and Magnant's conjecture. Every graph $G$ of order at least $(c+1)k$ with minimum degree $\delta(G)\geq ck$ contains $k$ vertex-disjoint $\frac{(c+1)(c-2)}{2}$-chorded cycles.

This conjecture is presented as a common generalization of Corrádi–Hajnal's theorem on disjoint cycles and Hajnal–Szemerédi's theorem on disjoint complete graphs. Its resolution is not specified in the source.