On a Theorem of Erdős, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Keyword(s):
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.
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽
Keyword(s):
1968 ◽
Vol 11
(5)
◽
pp. 729-732
◽
2013 ◽
Vol 3
(3)
◽
pp. 390-396
◽
Keyword(s):
2015 ◽
pp. 55-58
2021 ◽
Vol 12
(2)
◽
pp. 1040-1046