Akiyama–Watanabe conjecture on induced forests in bipartite planar graphs
Statement
Let be a simple bipartite planar graph. Write , and let denote the maximum number of vertices in an induced forest of . Akiyama–Watanabe conjecture.
The conjecture was proposed in 1987. The paper proves the weaker lower bound , so the stated bound is not resolved by the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.