ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Every finite simple connected graph GG with

∣V(G)∣=2d+1,diam⁡(G)=d≥3|V(G)|=2d+1,\qquad \operatorname{diam}(G)=d\ge 3

satisfies

W(G)≤W(C2d+1)=(2d+1)d(d+1)2.W(G)\le W(C_{2d+1}) =\frac{(2d+1)d(d+1)}2.

The claimed equality cases are exactly C2d+1C_{2d+1} for every d≥3d\ge3, the double star D2,3D_{2,3} when d=3d=3, and the nine-vertex tree T1,2,2=S(2,3,3)T_{1,2,2}=S(2,3,3) when d=4d=4.

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 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.