137
click to vote
DMTCS
2010
15 years 20 days ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...