# Abertson, Michael O.

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

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

Keywords:

Keywords:

- Subject
- Algebra (6)
- Analysis (5)
- Combinatorics (36)
- Geometry (28)
- Graph Theory (222)
- Group Theory (5)
- Logic (10)
- Number Theory (47)
- Theoretical Comp. Sci. (13)
- Topology (40)
- Unsorted (1)

- Author index
- Keyword index