A Decomposition Theorem for R n

DOI10.2307/2160488zbMath0805.04002OpenAlexW2089584440MaRDI QIDQ4290820

Péter Komjáth

Publication date: 5 May 1994

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2160488

zbMATH Keywords

colouring\(n\)-dimensional Euclidean spacetransfinite inductionrational distance

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Other combinatorial set theory (03E05)

Related Items (8)

Coloring the distance graphs ⋮ The list-chromatic number of infinite graphs defined on Euclidean spaces ⋮ Countable partitions of Euclidean space ⋮ Chromatic numbers of algebraic hypergraphs ⋮ Coloring ${\mathbb R}^n$ ⋮ Semialgebraic graphs having countable list-chromatic numbers ⋮ Avoidable algebraic subsets of Euclidean space ⋮ Unnamed Item

This page was built for publication: A Decomposition Theorem for R n