Abstract
It is proved that in Godel's constructible universe, for every infinite successor cardinal, there exist graphs G and H of size and chromatic number, for which the product graph G × H is countably chromatic.
| Original language | English |
|---|---|
| Pages (from-to) | 285-298 |
| Number of pages | 14 |
| Journal | Journal of the European Mathematical Society |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2017 |
Bibliographical note
Publisher Copyright:© 2017 European Mathematical Society.
Keywords
- Almost countably chromatic
- Constructible universe
- Hedetniemi's conjecture
- Incompactness
- Ostaszewski square
- Product graph