Partition of three-dimensional sets into five parts of smaller diameter

DOI10.1134/S0001434610010281zbMath1202.52019OpenAlexW2085976857MaRDI QIDQ1957037

Andrey B. Kupavskii, Andrei M. Raigorodskii

Publication date: 24 September 2010

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434610010281

zbMATH Keywords

Borsuk's problempartition of setsdiameter of setsuniversal cover (system)

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Related Items (2)

Borsuk's problem, Boltyanski's illumination problem, and circumradius ⋮ Partition bounded sets into sets having smaller diameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über die Bedeckung ebener Punktmengen durch solche kleineren Durchmessers
• Zerlegung ebener Bereiche in konvexe Zellen von möglichst kleinem Durchmesser
• Affine images of the rhombo-dodecahedron that are circumscribed about a three-dimensional convex body
• The Borsuk partition problem: the seventieth anniversary
• On the Borsuk and Erdős-Hadwiger numbers
• On Inscribing n-Dimensional Sets in a Regular n-Simplex
• Covering planar sets

This page was built for publication: Partition of three-dimensional sets into five parts of smaller diameter