ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Fk(Kn){\cal F}_k(K_n) be the supertoken graph whose vertices represent configurations of kk indistinguishable tokens on the complete graph KnK_n, with adjacency given by moving one token along an edge of KnK_n. The metric dimension of a graph is the minimum cardinality of a resolving set, namely a set of vertices whose distance vectors distinguish all vertices.

Metric-dimension conjecture. The metric dimension of the supertoken graph Fk(Kn){\cal F}_k(K_n) is

dim⁡(Fk(Kn))=n−1.\operatorname{dim}({\cal F}_k(K_n))=n-1.

The preceding proposition establishes the upper bound dim⁡(Fk(Kn))≤n−1\operatorname{dim}({\cal F}_k(K_n))\leq n-1; the conjecture asserts that this bound is sharp. The supplied text does not provide a lower-bound proof or evidence of resolution.

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.