ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn, kk, and k′k^{\prime} be integers with n≥k≥3n\geq k\geq3 and k>k′≥1k>k^{\prime}\geq1, and let TT be a tree with order nn. The Steiner diameter–radius conjecture.

Sdk(T)≤kk−k′Srk,k′(T)−k′(k′−1)k−k′.Sd_k(T)\leq\frac{k}{k-k^{\prime}}Sr_{k,k^{\prime}}(T)-\frac{k^{\prime}(k^{\prime}-1)}{k-k^{\prime}}.

The paper proves the inequality for k′=2k^{\prime}=2 and k′=3k^{\prime}=3, and states that it generalizes the known result for k′=1k^{\prime}=1. Its validity for all k′≥1k^{\prime}\geq1 under the displayed hypotheses remains open.

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.