More on Compactness of Chromatic Numbers

arXiv1302.3431MaRDI QIDQ6239636FDOQ6239636

Authors: S. Shelah 

Publication date: 14 February 2013

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.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

This page was built for publication: More on Compactness of Chromatic Numbers

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