Written on the Wall II - Conjecture 65

WOWII Conjecture 65:

For a simple connected graph $G$, the size $f(G)$ of a largest induced forest satisfies $f(G) \ge \operatorname{dist\_min}(A) + \lceil \operatorname{dist\_min}(M) / 3 \rceil$, where $A$ is the set of minimum-degree vertices, $M$ is the set of maximum-degree vertices, and $\operatorname{dist\_min}(S) = \min_{v \notin S} \operatorname{dist}(v, S)$ (see distMin).