On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
type: Item
instance of: scholarly article
title: On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
zbMATH Open document ID: 1005.05018
published in: The Electronic Journal of Combinatorics
publication date: 2002-09-22T00:00:00Z
full work available at URL: https://eudml.org/doc/122367
full work available at URL: v9i1n9.html
review text: 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.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1803676
zbMATH Keywords: hypergraph
author: Alexandr Kostochka
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1803676