Feedback vertex sets of planar digraphs with fixed digirth

Simon Dreyer, Alexandre Pinlou, Petru Valicov

Let $fvs(G)$ denote the size of a minimum feedback vertex set of a digraph $G$. We study $fv{s}_g(n)$, which is the maximum $fvs(G)$ over all $n$-vertex planar digraphs $G$ of digirt…