Albertson and Berman's induced forest conjecture for planar graphs

Let $G$ be a planar graph of order $n$. An induced forest of $G$ is a vertex-induced subgraph that is acyclic. Albertson and Berman's conjecture. Every planar graph of order $n$ admits an induced forest of order at least $\frac{n}{2}$. This conjecture seeks the optimal general lower bound for the forest number of planar graphs; the paper presents it as a challenging conjecture and does not state a resolution.