Covering cycles in sparse graphs

Frank Mousset, Nemanja Škorić, Miloš Trujić

Let $k\ge 2$ be an integer. Kouider and Lonc proved that the vertex set of every graph $G$ with $n\ge n_0(k)$ vertices and minimum degree at least $n/k$ can be covered by $k -…