Abstract: In 1963, Corrádi and Hajnal verified a conjecture of Erdős showing that every graph $G$ on at least $3k$ vertices with $\delta(G) \ge 2k$ contains $k$ disjoint cycles. Independently, Enomoto and Wang (1998 and 1999, resp.) extended this result of Corrádi and Hajnal by replacing the minimum degree condition with an Ore-degree condition. Recently, Kierstead, Kostochka, Molla and Yeager completed a characterization of the graphs that just fail the Ore-degree condition of Enomoto and Wang and do not contain k disjoint cycles. In 2008, Finkel proved an analogue of Corrádi-Hajnal for chorded cycles, requiring G to have at least $4k$ vertices and $\delta(G) ≥ 3k$ in order to guarantee $k$ disjoint chorded cycles. This result was extended by Chiba et al. in 2010, who replace the minimum degree condition with an Ore-degree condition. In this talk, we will discuss our proof of a chorded cycle analogue to that of Kierstead et al., in which we characterize the graphs that just fail the Ore-degree condition of Chiba et al. and do not contain $k$ disjoint chorded cycles. Time permitting, we will also present current progress towards a result that will provide a transition from our result to that of Kierstead et al. This is joint work with Theodore Molla and Elyse Yeager.