A Note on Uncountably Chromatic Graphs

  • Nathan Bowler
  • Max Pitz
DOI: https://doi.org/10.37236/13359

Abstract

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

Published
2025-02-14
How to Cite
Bowler, N., & Pitz, M. (2025). A Note on Uncountably Chromatic Graphs. The Electronic Journal of Combinatorics, 32(1), P1.23. https://doi.org/10.37236/13359
Issue
Volume 32, Issue 1 (2025)
Article Number
P1.23