Henning–Oellermann–Swart conjecture on the Steiner k-diameter and Steiner k-radius
Let be an integer, and let be a connected graph with order at least . The Steiner -diameter and Steiner -radius are defined using Steiner distances over -vertex subsets of .
Henning–Oellermann–Swart conjecture.
Henning, Oellermann and Swart proposed this bound; the paper states that it has been proved for and , while the general case remains open.
References
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.