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

Erdős, 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 $k$-partite graphs and complete $k$-uniform $k$-partite hypergraphs.

[1]  J. Beck,et al.  On 3-chromatic hypergraphs , 1978, Discret. Math..

[2]  Alexandr V. Kostochka,et al.  Coloring uniform hypergraphs with few colors , 2004, Random Struct. Algorithms.

[3]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[4]  Noga Alon,et al.  Choice Numbers of Graphs: a Probabilistic Approach , 1992, Combinatorics, Probability and Computing.

[5]  P. Erdos.  On a combinatorial problem. II , 1964 .

[6]  Joel H. Spencer,et al.  Coloring n-Sets Red and Blue , 1981, J. Comb. Theory, Ser. A.

[7]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[8]  Alexandr V. Kostochka,et al.  Density Conditions for Panchromatic Colourings of Hypergraphs , 2001, Comb..

[9]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.