, Volume 61, Issue 3, pp 285-294

Consistency results on infinite graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Consistently there exist ℵ2-chromatic graphs with no ℵ1-chromatic subgraphs. The statement that every uncountably chromatic graph of size ℵ1 contains an uncountably chromaticω-connected subgraph is consistent and independent. It is consistent that there is an uncountably chromatic graph of size ℵω 1 in which every subgraph with size less than ℵω 1 is countably chromatic.

Partially supported by Hungarian Science Research Fund Nu. 1805.