O-joung Kwon

Erd\H{o}s-P\'{o}sa property for induced packings of long $S$-cycles

The Erd\H{o}s-P\'{o}sa theorem states that for every integer $k\geq1$, every graph contains either $k$ vertex-disjoint cycles or a set of $\mathcal{O}(k\log k)$ vertices meeting all cycles. This fundamental min-max duality has been extended to numerous settings, including long cycles, $S$-cycles, that is, cycles contai...