A note on uncountably chromatic graphs

2024/02/08 by Nathan Bowler, Bowler, Nathan, Max Pitz +1
Computer Science · Mathematics · #05C63 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Logic (math.LO)

paper · pdf · doi:10.48550/arxiv.2402.05984

openalex publication_date 2024/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Related

• Trees, ladders and graphs
• Uncountable dichromatic number without short directed cycles
• Obligatory hypergraphs
• Finite subgraphs of uncountably chromatic graphs
• An Alternate method to find the chromatic number of a Finite, Connected Graph