On incompactness for chromatic number of graphs (Q2448949): Difference between revisions

The main result of the paper reads as follows. Let \(\kappa<\lambda\) be two regular infinite cardinals such that \(\lambda=\lambda^\kappa\) and there exists a non-reflecting stationary set \(S \subseteq\{\alpha<\lambda : \mathrm{cf}(\alpha) = \kappa\}\). Then there is a graph \(G\) with \(\lambda\) nodes and chromatic number \(>\kappa\) such that every subgraph with \(<\lambda\) nodes has chromatic number \(\leq\kappa\).