Connectivity and chromatic number of infinite graphs
It is proved that for every positive integer n, a graph of uncountable chromatic number contains an n-connected subgraph H of uncountable chromatic number such that every vertex of H has infinite degree in H.
scientific article; zbMATH DE number 4101219