Induced Forests in Bipartite Planar Graphs
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 (4n+3)/7 vertices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.