A note on uncountably chromatic graphs
Combinatorics
2024-05-20 v2 Logic
Abstract
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
Keywords
Cite
@article{arxiv.2402.05984,
title = {A note on uncountably chromatic graphs},
author = {Nathan Bowler and Max Pitz},
journal= {arXiv preprint arXiv:2402.05984},
year = {2024}
}
Comments
3 pages; V2 corrects a mistake in the last line of the proof