ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bipartite graph with maximum degree at most Δ\Delta, and let kk be a positive integer. The graph is kk-choosable if every assignment of lists of kk colours to its vertices admits a proper colouring from those lists. Krivelevich–Alon conjecture. There is an absolute constant C>0C>0 such that GG is kk-choosable whenever k≥Clog⁡Δk\geq C\log\Delta. This conjecture extends the asymptotic behaviour of complete bipartite graphs to all bipartite graphs of maximum degree Δ\Delta. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.