Before revision: Recently, a tight extremal bound was proven which showed that given any plane graph , there always exist a cactus subgraph containing at least fraction of the triangular faces of .
After revision: Every plane graph contains a cactus subgraph which includes at least fraction of the triangular faces of .