Nearly platonic graph two-exceptional-faces conjecture
Statement
Let be a vertex-regular planar graph, and suppose that all but two faces of have the same degree. Nearly platonic graph conjecture. The remaining two faces must have the same degree as each other. The conjecture arises from the construction of nearly platonic graphs, in which the two exceptional faces have consistently been observed to have equal degree. The authors report that they have been unable to find a counterexample.
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.