A better bound on the largest induced forests in triangle-free planar graphs

Hung Le

It is well-known that there exists a triangle-free planar graph of $n$ verticess such that the largest induced forest has size at most $\frac{5n}{8}$. Salavatipour proved that ther…