Erdős Problem #753 — List Chromatic Numbers of a Graph and Its Complement
Statement
A graph is -choosable if, for every assignment of a finite list of exactly natural-number colours to each vertex, there exists a proper colouring of such that for every vertex . Define the list chromatic number to be the least such . Does there exist a real constant such that, for every with and every graph on vertices, where is the complement of ?
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.