A note on uncountably chromatic graphs

Nathan Bowler, Max Pitz

We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.