What is the list-chromatic number of Sudoku
Statement
: What is the list-chromatic number of Sudoku? That is, suppose one places k symbols (aka colors) in each cell of a Sudoku board -- not necessarily all the same lists of symbols. What is the least k so that it is always possible to choose a symbol/color from each list for its cell that the resulting choices have no conflicts in rows, columns, or blocks (the 3X3 submatrices that cannot have conflicts in ordinary Sudoku)? This is the Sudoku analogue of the famous Dinitz Conjecture / Galvin Theorem. Even for k=4, the question is open.
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.