A Decomposition Theorem for R n

DOI10.2307/2160488MaRDI QIDQ4290820zbMATH OpenOpenAlexFDO

Authors 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

\(n\)-dimensional Euclidean spacecolouringrational distancetransfinite induction

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 496012
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• A Coloring Result for the Plane
• scientific article; zbMATH DE number 1406330

Cited in

(17)

• Patch colorings and rigid colorings of the rational \(n\)-space
• Chromatic numbers of algebraic hypergraphs
• Coloring \({\mathbb R}^n\)
• Semialgebraic graphs having countable list-chromatic numbers
• scientific article; zbMATH DE number 5356323 (Why is no real title available?)
• A Coloring Result for the Plane
• scientific article; zbMATH DE number 496012 (Why is no real title available?)
• scientific article; zbMATH DE number 1790528 (Why is no real title available?)
• Countable partitions of Euclidean space
• A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids
• scientific article; zbMATH DE number 1406330 (Why is no real title available?)
• Avoidable algebraic subsets of Euclidean space
• Applications of the axiom of choice to constructions in Euclidean spaces
• Coloring the distance graphs
• The list-chromatic number of infinite graphs defined on Euclidean spaces
• Coloring closed Noetherian graphs
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290820)