A graph G is said to be uniquely colorable it has only one optimal coloring up to permutation of the colors
Statement
: A graph G is said to be uniquely colorable it has only one optimal coloring up to permutation of the colors. (That is, there is only one partition into a minimum number of independent sets.) Is it false that G(n,1/2) is uniquely colorable (aas)?
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.