ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be a connected, locally finite graph. The motion of XX is

m(X)=inf⁡{m(f)∣f∈Aut⁡(X), f≠id⁡},m(X)=\inf\{m(f)\mid f\in\operatorname{Aut}(X),\ f\neq\operatorname{id}\},

where m(f)m(f) is the cardinality of the set of vertices not fixed by ff. The graph XX has infinite motion when m(X)m(X) is infinite.

Infinite motion conjecture. If XX is a connected, locally finite graph with infinite motion, then

D(X)≤2.D(X)\leq 2.

This conjecture proposes that every connected, locally finite graph whose nontrivial automorphisms move infinitely many vertices admits a distinguishing vertex coloring with two colors. The paper proves the conjecture under additional hypotheses, but the general statement is presented as an open problem.

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.