On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs

Erdos, Rubin, and Taylor 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 kpartite graphs and complete k-uniform k-partite hypergraphs.

• Type: Journal
• Year: 2002
• Where: COMBINATORICS
• Authors: Alexandr V. Kostochka
• Keywords: COMBINATORICS 2002, Complete Bipartite Graph, Minimum Order, Nice Correspondence