... combinatorics 9 (2002), #N9 2On a theorem of Erd˝os, Rubin, and Taylor onchoosability of complete bipartite graphsAlexandr Kostochka∗University of Illinois at Urbana–Champaign, Urbana, IL 61801and ... 05C65AbstractErd˝os, Rubin, and Taylor found a nice correspondence between the minimumorder of a complete bipartite graph that is not r-choosable and the minimum numberof edges in an r-uniform hypergraph ... result shows close relations between ordinary hypergraph 2-coloring and listcoloring of complete bipartite graphs. Note that m(r, 2)wasstudiedin[2,3,4,9,10].Using known bounds on m(r, 2), Theorem...