When is ch(K(m,n))=m-1?

Nurit Gazit

Let n_m be the smallest integer n such that ch(K_{m,n}) = m-1, where ch(G) denotes the choice (list chromatic) number of the graph G. We prove that there is an infinite sequence of…