Erdős–Rubin–Taylor conjecture on non-4-choosable planar graphs
Statement
A planar graph is a graph that can be drawn in the plane without crossings. A graph is 4-choosable if every assignment of lists of four colors admits a proper coloring from those lists. Erdős–Rubin–Taylor's conjecture. There exists a planar graph which is not 4-choosable. This contrasts with the four-color theorem, which guarantees ordinary 4-colorability for every planar graph; the conjecture was disproved by Voigt's example of a non-4-choosable planar graph.
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.