A note on uncountably chromatic graphs
arXiv:2402.05984
Abstract
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
3 pages; V2 corrects a mistake in the last line of the proof