Krivelevich–Alon conjecture on the list chromatic number of bipartite graphs
Statement
Let be a bipartite graph with maximum degree at most , and let be a positive integer. The graph is -choosable if every assignment of lists of colours to its vertices admits a proper colouring from those lists. Krivelevich–Alon conjecture. There is an absolute constant such that is -choosable whenever . This conjecture extends the asymptotic behaviour of complete bipartite graphs to all bipartite graphs of maximum degree . The source presents it as an open conjecture and notes that the paper's results give partial progress, especially in asymmetric cases.
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.