Kaul–Mudrock conjecture for unlabeled list color functions of edgeless graphs
Statement
Let be an edgeless graph on vertices. For each , define as the minimum, over all -assignments for , of the number of equivalence classes of proper -colorings under automorphisms of ; let denote the corresponding number when every vertex receives the list . Kaul–Mudrock conjecture. For each there is an such that
whenever . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.