Faudree–Fronček–Ryjáček–Locke–Langley conjecture on 2-factors in claw-free graphs

Let $G$ be a claw-free graph, meaning that $G$ has no induced subgraph isomorphic to $K_{1,3}$. Let $\delta(G)$ denote its minimum degree and let $\alpha(G)$ denote its independence number. A 2-factor is a $2$-regular spanning subgraph. Faudree et al.'s conjecture. If

$$\delta(G)\geq \alpha(G)+1,$$

then $G$ has a $2$-factor with exactly $\alpha(G)$ cycles. This conjecture proposes a substantially smaller minimum-degree condition than earlier sufficient conditions; the source states that the bound cannot be improved for existence of such a 2-factor, but does not state that the conjecture itself has been resolved.