Hafidh's sharp tree multiset dimension bound

From papers

Let TT be a tree with order nn and diameter diam(T)\operatorname{diam}(T), and let md(T)md(T) denote its multiset dimension. Hafidh's conjecture. If md(T)<md(T)<\infty, then

md(T)ndiam(T)+1,md(T) \le n-\operatorname{diam}(T)+1,

and this bound is sharp. The source presents this as a further conjecture after noting that the preceding general conjecture had been proved for trees. No resolution of this sharper bound is supplied in the provided text.

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

Azzah Albejani, Yuqing Lin, Joe Ryan and Kiki A. Sugeng, “A Survey on Multiset Dimension and Its Variations”, arXiv:2607.08128 (2026).

Additional references

3 papers in this index state this conjecture (2017–2026). The statement above is taken from the most recent of them; the others are arXiv:1908.05879, arXiv:1711.00225.

Solutions 0

No solutions have been posted yet.