ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the cycle graph on nn vertices, and let ext⁡D(Cn)\operatorname{ext}_D(C_n) denote the minimum number of blanks such that every coloring of the remaining vertices extends to a distinguishing coloring of CnC_n.

Cycle extension conjecture.

ext⁡D(Cn)={4if n≢0(mod4 or 5),5if n≡0(mod4),6if n≡0(mod5).\operatorname{ext}_D(C_n)=\begin{cases}4&\text{if }n\not\equiv 0\pmod{4\text{ or }5},\\5&\text{if }n\equiv 0\pmod 4,\\6&\text{if }n\equiv 0\pmod 5. \end{cases}

The conjecture is sharp for the displayed cases, and the paper verifies it whenever the minimum prime divisor of nn is at least 77; the general case remains open.

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.