ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Cn2kC_n^{2k} denote the 2k2k-th power of the cycle CnC_n. Let GG be a 2k2k-connected graph of order nn. Dankelmann–Swart–Oellermann conjecture.

sdiam⁡k(G)≤sdiam⁡k(Cn2k).\operatorname{sdiam}_k(G)\leq \operatorname{sdiam}_k(C_n^{2k}).

This conjectures that the 2k2k-th power of the cycle maximizes the Steiner kk-diameter among 2k2k-connected graphs of order nn, generalizing the stated extremal result for 22-connected graphs. The supplied text gives no resolution.

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.