Asymmetric List Sizes in Bipartite Graphs.

Given a bipartite graph with parts A and B having maximum degrees at most Δ A and Δ B , respectively, consider a list assignment such that every vertex in A or B is given a list of colours of size k A or k B , respectively. We prove some general sufficient conditions in terms of Δ A , Δ B , k A , k B to be guaranteed a proper colouring such that each vertex is coloured using only a colour from its list. These are asymptotically nearly sharp in the very asymmetric cases. We establish one sufficient condition in particular, where Δ A = Δ B = Δ , k A = log Δ and k B = (1 + o (1)) Δ / log Δ as Δ → ∞ . This amounts to partial progress towards a conjecture from 1998 of Krivelevich and the first author. We also derive some necessary conditions through an intriguing connection between the complete case and the extremal size of approximate Steiner systems. We show that for complete bipartite graphs these conditions are asymptotically nearly sharp in a large part of the parameter space. This has provoked the following. In the setup above, we conjecture that a proper list colouring is always guaranteed if k A ≥ Δ A ε and k B ≥ Δ B ε for any ε > 0 provided Δ A and Δ B are large enough; if k A ≥ C log Δ B and k B ≥ C log Δ A for some absolute constant C > 1 ; or if Δ A = Δ B = Δ and k B ≥ C (Δ / log Δ) 1 / k A log Δ for some absolute constant C > 0 . These are asymmetric generalisations of the above-mentioned conjecture of Krivelevich and the first author, and if true are close to best possible. Our general sufficient conditions provide partial progress towards these conjectures. [ABSTRACT FROM AUTHOR]