Hitting cycles through prescribed vertices or edges

Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2

We prove that for every set $S$ of vertices of a directed graph $D$, the maximum number of vertices in $S$ contained in a collection of vertex-disjoint cycles in $D$ is at least th…