ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree of order nn, and let PnP_n denote the path on nn vertices. The equidistant dimension of a graph, denoted by eqdimeqdim, is the minimum cardinality of a distance-equalizer set.

Tree equidistant dimension conjecture.

eqdim(T)≤eqdim(Pn).eqdim(T)\leq eqdim(P_n).

The conjecture proposes that among all trees of order nn, the path has maximum equidistant dimension. The exact value of the equidistant dimension of trees is not known, although the path is suggested by the fact that every pair of vertices in a path has at most one equidistant vertex.

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.