The cycle extension distinguishing number conjecture
Statement
Let be the cycle graph on vertices, and let denote the minimum number of blanks such that every coloring of the remaining vertices extends to a distinguishing coloring of .
Cycle extension conjecture.
The conjecture is sharp for the displayed cases, and the paper verifies it whenever the minimum prime divisor of is at least ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.