ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The supplied source identifies this as a conjecture about finite graphs, with the relevant configuration involving a connected graph GG of radius 33 having exactly one diametrical pair, i.e. ∣{{u,v}⊆V(G):dG(u,v)=diam⁡(G)}∣=1\left|\left\{\{u,v\}\subseteq V(G):d_G(u,v)=\operatorname{diam}(G)\right\}\right|=1. 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 1010-vertex counterexample formally checked in Lean.

Record

Added
Links

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.