Nonadjacency conjecture for degree-5 vertices in edge-to-edge plane graphs
Statement
Let be an edge-to-edge plane graph. A pair of vertices of degree is called adjacent when the two vertices are joined by an edge.
Nonadjacency conjecture. Are there any two degree- vertices adjacent in ? No way! Equivalently, no two degree- vertices in are adjacent.
This conjecture is presented as covering the previous results in the paper, but the authors state that an attempted proof contained a bug and that the claim remains unresolved.
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.