Identical lists maximize the probability of a non-distinguishing coloring
Statement
Let be a graph, and let be a collection of equal-sized lists, each of size , indexed by the vertices of . Choose a color from each vertex's list uniformly and independently, and let be the probability that the resulting coloring admits a non-trivial automorphism preserving every color class. List-probability strengthening. The probability is maximized when all the lists are identical. This would strengthen the List Distinguishing Conjecture by identifying the worst-case list assignment for random colorings.
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.