# Berman, David M.

## Large induced forest in a planar graph. ★★

Author(s): Abertson; Berman

\begin{conjecture} Every planar graph on $n$ verices has an induced forest with at least $n/2$ vertices. \end{conjecture}

Keywords: