On incompactness for chromatic number of graphs (Q2448949): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1205.0064 / rank | |||
Normal rank |
Revision as of 06:25, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On incompactness for chromatic number of graphs |
scientific article |
Statements
On incompactness for chromatic number of graphs (English)
0 references
5 May 2014
0 references
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\).
0 references
chromatic number
0 references
compactness
0 references
non-reflecting stationary set
0 references