ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let L=L\mathcal{L}=\mathcal{L} be a collection of equal-sized lists, each of size kk, indexed by the vertices veq0v eq 0 of GG. Choose a color from each vertex's list uniformly and independently, and let p(L)p(\mathcal{L}) be the probability that the resulting coloring admits a non-trivial automorphism preserving every color class. List-probability strengthening. The probability p(L)p(\mathcal{L}) 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 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.