Abstract
For every graph G, the coloring number of G does not exceed the least strong limit cardinal above the graph’s list-chromatic number.
| Original language | English |
|---|---|
| Pages (from-to) | 585-592 |
| Number of pages | 8 |
| Journal | Israel Journal of Mathematics |
| Volume | 201 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2 Oct 2014 |
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'Shelah’s revised GCH theorem and a question by Alon on infinite graphs colorings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver