A tight Erdős-Pósa function for long cycles

Frank Mousset, Andreas Noever, Nemanja Škorić +1

A classic result of Erdős and Pósa says that any graph contains either $k$ vertex-disjoint cycles or can be made acyclic by deleting at most $O(k\log k)$ vertices. Here we general…