Erdős Problem #632 — Scaling multilist choosability
Statement
For positive integers , if a graph is -choosable, must it also be -choosable? Here -choosable means that from every assignment of an -element colour list to each vertex one can choose a -element subset at each vertex so that adjacent vertices receive disjoint subsets.
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.