Alon–Cambie–Kang asymmetric choosability conjecture for bipartite graphs
Statement
Let be a bipartite graph with bipartition . Write and for the maximum degrees of vertices in and , respectively. The graph is -choosable if every list assignment giving vertices of lists of size and vertices of lists of size admits a proper coloring from the lists.
Alon–Cambie–Kang conjecture. Suppose that and that are positive integers. Then:
- for every there is a such that is -choosable whenever , , and ;
- there is an absolute constant such that is -choosable whenever and ;
- there is an absolute constant such that is -choosable whenever and
These are asymmetric generalizations of the Alon–Krivelevich conjecture. The conjecture is stated for general bipartite graphs, while the source discusses corresponding results for complete bipartite graphs; its resolution status is not given.
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.