Countable decompositions of R^2 and R^3

DOI10.1007/BF02187793MaRDI QIDQ756706zbMATH OpenOpenAlexWikidataFDO

Authors Péter Komjáth, P. Erdős

Publication date 1990

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02187793

zbMATH Keywords

decompositionisoscelesright-angled triangle

Mathematics Subject Classification ID

Geometric constructions in real or complex geometry (51M15) Erd?s problems and related topics of discrete geometry (52C10)

Review text

The authors prove that if the continuum hypothesis holds, then \({\mathbb{R}}^2\) can be decomposed into countably many pieces, none spanning a right-angled triangle. They also obtain some partial results concerning the conjecture that the given result is also true when `right- angled' is replaced by `isosceles'. Finally, they show that \({\mathbb{R}}^3\) can be coloured with countably many colours with no monochromatic rational distance.

Recommendations

• A Decomposition Theorem for R n
• Triangle-Free Partitions of Euclidean Space
• scientific article; zbMATH DE number 496012
• Concerning the continuum hypothesis and rectilinear sections of spatial sets
• Decompositions of the plane and the size of the continuum

Cites work

• Covering the Plane with Denumerably Many Curves
• scientific article; zbMATH DE number 3646948 (Why is no real title available?)
• scientific article; zbMATH DE number 3501471 (Why is no real title available?)
• scientific article; zbMATH DE number 3290309 (Why is no real title available?)
• scientific article; zbMATH DE number 3300442 (Why is no real title available?)
• scientific article; zbMATH DE number 3308988 (Why is no real title available?)
• On chromatic number of graphs and set-systems
• Set theoretic, measure theoretic, combinatorial, and number theoretic problems concerning point sets in Euclidean space
• Set theory. An introduction to independence proofs

Cited in

(20)

• Convex decompositions in the plane and continuous pair colorings of the irrationals
• Coloring \({\mathbb R}^n\)
• GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES
• Decompositions of the plane and the size of the continuum
• A Decomposition Theorem for R n
• SET MAPPINGS WITH FREE SETS WHICH ARE ARITHMETIC PROGRESSIONS
• DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS
• Triangle-Free Partitions of Euclidean Space
• Countable partitions of Euclidean space
• A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids
• Avoidable algebraic subsets of Euclidean space
• Applications of the axiom of choice to constructions in Euclidean spaces
• Some algebraic equivalent forms of $\mathbb {R}\subseteq L$
• Krull dimension in set theory
• Coloring the distance graphs
• Coloring triangles and rectangles
• Corrigendum to: ``Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• The list-chromatic number of infinite graphs defined on Euclidean spaces
• Two graph games
• Concerning the continuum hypothesis and rectilinear sections of spatial sets

This page was built for publication: Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)

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