WOWII Graph Conjecture 36
Statement
The supplied source identifies this as a conjecture about finite graphs, with the relevant configuration involving a connected graph of radius having exactly one diametrical pair, i.e. . The conjecture’s full conclusion and any additional hypotheses are not reproduced in the supplied material. The conjecture is reported to be false, with an explicit -vertex counterexample formally checked in Lean.
Record
- Added
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.