On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
From MaRDI portal
Publication:698614
zbMATH Open1005.05018MaRDI QIDQ698614FDOQ698614
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
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
- Title not available (Why is that?)
- Extremal problems in hypergraph colourings
- List colorings of multipartite hypergraphs
- Title not available (Why is that?)
- On the choosability of complete multipartite graphs with part size three
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Note on polychromatic coloring of hereditary hypergraph families
- Chain method for panchromatic colorings of hypergraphs
- 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)
