ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple bipartite planar graph. Write ∣G∣=∣V(G)∣|G|=|V(G)|, and let a(G)a(G) denote the maximum number of vertices in an induced forest of GG. Akiyama–Watanabe conjecture.

a(G)≥5∣G∣8.a(G) \geq \frac{5|G|}{8}.

The conjecture was proposed in 1987. The paper proves the weaker lower bound a(G)≥⌈(4∣G∣+3)/7⌉a(G)\geq \lceil(4|G|+3)/7\rceil, so the stated 5∣G∣/85|G|/8 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.