ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Kˉn\bar{K}_n be an edgeless graph on nn vertices. For each n∈Nn \in \mathbb{N}, define Pℓu(Kˉn,k)P^u_{\ell}(\bar{K}_n,k) as the minimum, over all kk-assignments LL for Kˉn\bar{K}_n, of the number Pu(Kˉn,L)P^u(\bar{K}_n,L) of equivalence classes of proper LL-colorings under automorphisms of Kˉn\bar{K}_n; let Pu(Kˉn,k)P^u(\bar{K}_n,k) denote the corresponding number when every vertex receives the list [k][k]. Kaul–Mudrock conjecture. For each n∈Nn \in \mathbb{N} there is an N∈NN \in \mathbb{N} such that

Pℓu(Kˉn,k)=Pu(Kˉn,k)P^u_{\ell}(\bar{K}_n,k)=P^u(\bar{K}_n,k)

whenever k≥Nk \geq N. The conjecture is the edgeless-graph case of the question posed by Kaul and Mudrock for which graphs the unlabeled list color function eventually agrees with the unlabeled color function. It was verified for point-determining graphs, but the general question, including this case, was open in the source.

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.