Given a graph $ G $ and an integer $ k $, Max Min FVS asks whether there exists a minimal
set of vertices of size at least $ k $ whose deletion destroys all cycles. We present several …