On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs

zbMath1005.05018MaRDI QIDQ698614

Alexandr V. Kostochka

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

zbMATH Keywords

hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Improper Choosability and Property B ⋮ Chain method for panchromatic colorings of hypergraphs ⋮ Panchromatic 3-coloring of a random hypergraph ⋮ A note on panchromatic colorings ⋮ Panchromatic 3-colorings of random hypergraphs ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ Extremal problems in hypergraph colourings ⋮ On a generalization of Rubin's theorem ⋮ Panchromatic colorings of random hypergraphs ⋮ Choosability with Separation of Complete Multipartite Graphs and Hypergraphs ⋮ List colorings of multipartite hypergraphs

This page was built for publication: On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs