Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)

DOI10.1007/BF02187793zbMath0723.52005OpenAlexW1975093290WikidataQ105815852 ScholiaQ105815852MaRDI QIDQ756706

Péter Komjáth, Paul 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

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

Related Items (13)

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 ⋮ SET MAPPINGS WITH FREE SETS WHICH ARE ARITHMETIC PROGRESSIONS ⋮ Countable partitions of Euclidean space ⋮ DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS ⋮ Coloring ${\mathbb R}^n$ ⋮ Avoidable algebraic subsets of Euclidean space ⋮ Some algebraic equivalent forms of $\mathbb {R}\subseteq L$ ⋮ GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES ⋮ Unnamed Item

Cites Work

• Set theoretic, measure theoretic, combinatorial, and number theoretic problems concerning point sets in Euclidean space
• Set theory. An introduction to independence proofs
• On chromatic number of graphs and set-systems
• Covering the Plane with Denumerably Many Curves
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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