More on Compactness of Chromatic Numbers
Logic
2013-02-20 v2
Abstract
We prove that for any regular kappa and mu > kappa below the first fix point (lambda = aleph_lambda) above kappa, there is a graph with chromatic number > kappa, and mu^kappa nodes but every subgraph of cardinality < mu has chromatic number less than or equal to kappa.
Cite
@article{arxiv.1302.3431,
title = {More on Compactness of Chromatic Numbers},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:1302.3431},
year = {2013}
}
Comments
8 pages