Erdős Problem #631 — The sharp list chromatic number of planar graphs
Statement
Does every planar graph satisfy , and is the bound best possible?
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.