2021/08/22 by Jindřich Zapletal, Zapletal, Jindrich · 1 citation
Computer Science · Mathematics · #03E15 #03E25 #03E35 #Computability, Logic, AI Algorithms #Computational Geometry and Mesh Generation #FOS: Mathematics #Logic (math.LO) #Mathematics and Applications
paper · pdf · doi:10.48550/arxiv.2108.09850
openalex publication_date 2021/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let n>1 be a number. Let Gn be the hypergraph of all rectangles in an n-dimensional Euclidean space. It is consistent that ZF+DC holds, the chromatic number of Gn is countable, yet the chromatic number of Gn+1 is uncountable.