On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
From MaRDI portal
Publication:698614
zbMath1005.05018MaRDI QIDQ698614
Publication date: 22 September 2002
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122367
Related Items
Extremal problems in hypergraph colourings, List colorings of multipartite hypergraphs, Improper Choosability and Property B, Choosability with Separation of Complete Multipartite Graphs and Hypergraphs, Panchromatic 3-coloring of a random hypergraph, A note on panchromatic colorings, Panchromatic colorings of random hypergraphs, Chain method for panchromatic colorings of hypergraphs, The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets, Panchromatic 3-colorings of random hypergraphs, On a generalization of Rubin's theorem