A note on uncountably chromatic graphs
Abstract
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.