A lower bound on the order of the largest induced forest in planar graphs with high girth

François Dross, Mickael Montassier, Alexandre Pinlou

We give here new upper bounds on the size of a smallest feedback vertex set in planar graphs with high girth. In particular, we prove that a planar graph with girth $g$ and size $m…