{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:07:56Z","timestamp":1774627676859,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Erd\u0151s, 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.<\/jats:p>","DOI":"10.37236\/1670","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T21:25:23Z","timestamp":1578691523000},"source":"Crossref","is-referenced-by-count":19,"title":["On a Theorem of Erd\u0151s, Rubin, and Taylor on Choosability of Complete Bipartite Graphs"],"prefix":"10.37236","volume":"9","author":[{"given":"Alexandr","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2002,8,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n9\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:13:33Z","timestamp":1579306413000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v9i1n9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8,13]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2002,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1670","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,8,13]]},"article-number":"N9"}}