ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, let PP be a graph, and write diam⁡(P)\operatorname{diam}(P) for its diameter, r(P)r(P) for its radius, and Aucg(Kn,P)A_{ucg}(K_n,P) for the corresponding appendage number. The uniform central graph appendage conjecture. If

diam⁡(P)=r(P)=3,\operatorname{diam}(P)=r(P)=3,

then

Aucg(Kn,P)=2.A_{ucg}(K_n,P)=2.

The preceding results determine the value in the other diameter–radius cases; when diam⁡(P)=r(P)=3\operatorname{diam}(P)=r(P)=3, the authors know only that the appendage number is 22 or 33, and all their examples have value 22.

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.