The Borsuk partition problem: the seventieth anniversary

DOI10.1007/BF02986745zbMath1067.52006MaRDI QIDQ1777522

Andrei M. Raigorodskii

Publication date: 23 May 2005

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Mathematics Subject Classification ID

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

Related Items

Independence numbers and chromatic numbers of some distance graphs, Counterexamples to Borsuk's conjecture on spheres of small radius, On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems, Partition of three-dimensional sets into five parts of smaller diameter, On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem, Around Borsuk's hypothesis, Borsuk's problem and the chromatic numbers of metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Affine images of the rhombo-dodecahedron that are circumscribed about a three-dimensional convex body
• Intersection theorems with geometric consequences
• New sets with large Borsuk numbers
• On the Borsuk problem in \(\mathbb R^ 3\).
• Excursions into combinatorial geometry
• Überdeckung einer Menge durch Mengen kleineren Durchmessers
• Zur Zerlegung von Punktmengen in solche kleineren Durchmessers
• Borsuk's problem and the chromatic numbers of some metric spaces
• A counterexample to Borsuk’s conjecture
• Zum Borsukschen Zerteilungsproblem
• Illuminating sets of constant width
• On a bound in Borsuk's problem
• Covering a sphere with spheres
• Symmetrical sets of constant width and their partitions
• On Sets of Distances of n Points
• Covering a Three-Dimensional set with Sets of Smaller Diameter