On pseudo 2-factors

We show that a graph with minimum degree δδ, independence number α≥δα≥δ and without isolated vertices, possesses a partition by vertex-disjoint cycles and at most α−δ+1α−δ+1 edges or vertices.