Induced Forests in Bipartite Planar Graphs
classification
🧮 math.CO
keywords
verticesbipartiteinducedplanarcontainseveryforestgraph
read the original abstract
Akiyama and Watanabe conjectured that every simple planar bipartite graph on $n$ vertices contains an induced forest on at least $5n/8$ vertices. We apply the discharging method to show that every simple bipartite planar graph on $n$ vertices contains an induced forest on at least $\lceil (4n+3)/7 \rceil$ vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.