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

MaRDI QIDQ698614zbMATH OpenFDO

Authors Alexandr 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, http://www.emis.de/journals/EJC/Volume_9/Abstracts/v9i1n9.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

hypergraph

Mathematics Subject Classification ID

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

Recommendations

• On the choosability of complete multipartite graphs with part size three
• Choice number of some complete multi-partite graphs
• scientific article; zbMATH DE number 1153458
• On the choice number of complete multipartite graphs with part size four
• On a generalization of Rubin's theorem

Cited in

(16)

• On a generalization of Rubin's theorem
• Improper choosability and property B
• Panchromatic colorings of random hypergraphs
• Panchromatic 3-colorings of random hypergraphs
• scientific article; zbMATH DE number 5850546 (Why is no real title available?)
• Extremal problems in hypergraph colourings
• List colorings of multipartite hypergraphs
• scientific article; zbMATH DE number 3920511 (Why is no real title available?)
• On the choosability of complete multipartite graphs with part size three
• On choosability of some complete multipartite graphs and Ohba's conjecture
• Chain method for panchromatic colorings of hypergraphs
• Note on polychromatic coloring of hereditary hypergraph families
• A note on panchromatic colorings
• Panchromatic 3-coloring of a random hypergraph
• Choosability with separation of complete multipartite graphs and hypergraphs
• The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698614)