The seven-eighths conjecture for induced 2-degenerate subgraphs of triangle-free planar graphs
Statement
Let be a triangle-free planar graph. An induced subgraph is 2-degenerate if every nonempty subgraph of it has a vertex of degree at most .
Seven-eighths conjecture. Every triangle-free planar graph contains an induced 2-degenerate subgraph on at least
vertices.
The conjecture proposes the optimal-looking proportion for induced subgraphs of lower degeneracy in triangle-free planar graphs. The paper proves a weaker bound, including an asymptotic bound with an additive error depending on the number of faces of the plane graph, but does not establish the stated proportion in full.
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.