ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph. Here D′(G)D'(G) denotes the distinguishing index of GG, and OD′−(G)OD'^-(G) denotes the negative oriented distinguishing index.

Lower-bound conjecture.

OD′−(G)≥⌊D′(G)/2⌋.OD'^-(G)\geq \lfloor D'(G)/2\rfloor.

If true, this would show that a suitable orientation cannot reduce the number of required colours by more than half; in particular, every graph with a rigid orientation would have distinguishing index at most three. The conjecture is 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.