Henning–Oellermann–Swart conjecture on the Steiner k-diameter and Steiner k-radius

From papers

Let k2k\geq 2 be an integer, and let GG be a connected graph with order at least kk. The Steiner kk-diameter Sdk(G)Sd_k(G) and Steiner kk-radius Srk(G)Sr_k(G) are defined using Steiner distances over kk-vertex subsets of GG.

Henning–Oellermann–Swart conjecture.

Sdk(G)2(k+1)2k1Srk(G).Sd_k(G)\leq\dfrac{2(k+1)}{2k-1}Sr_k(G).

Henning, Oellermann and Swart proposed this bound; the paper states that it has been proved for k=3k=3 and k=4k=4, while the general case remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Qingnan Zhang and Yingzhi Tian, “On the Steiner k-diameter and Steiner (k,k^)-radius of trees”, arXiv:2511.22492 (2025).

Additional references

2 papers in this index state this conjecture (2019–2025). The statement above is taken from the most recent of them; the others are arXiv:1907.07658.

Solutions 0

No solutions have been posted yet.