On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs (Q698614)

Summary: \textit{P. Erdős, A. L. Rubin}, and \textit{H. Taylor} [Congr. Numerantium 26, 125-157 (1980; Zbl 0469.05032)] found a nice correspondence between the minimum order of a complete bipartite graph that is not \(r\)-choosable and the minimum number of edges in an \(r\)-uniform hypergraph that is not \(2\)-colorable (in the ordinary sense). In this note we use their ideas to derive similar correspondences for complete \(k\)-partite graphs and complete \(k\)-uniform \(k\)-partite hypergraphs.