Erdős-Pósa property for induced packings of long $S$-cycles

Jungho Ahn, O-joung Kwon

The Erdős-Pósa theorem states that for every integer $k\ge 1$, every graph contains either $k$ vertex-disjoint cycles or a set of $\mathcal{O}(k\log k)$ vertices meeting all cycles…