The lower bound for negative oriented distinguishing index
Statement
Let be a connected graph. Here denotes the distinguishing index of , and denotes the negative oriented distinguishing index.
Lower-bound conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.