On the partition of plane sets into 6 subsets of small diameter

DOI10.1007/s10958-023-06670-0MaRDI QIDQ6147866

Valerij O. Koval'

Publication date: 1 February 2024

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

diametercovering setsBorsuk's problemLentz's problempartitions of the plane sets

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Geometric constructions in real or complex geometry (51M15)

Cites Work

• Proof of Schur's conjecture in \(\mathbb R^D\)
• Über die Bedeckung ebener Punktmengen durch solche kleineren Durchmessers
• Zerlegung ebener Bereiche in konvexe Zellen von möglichst kleinem Durchmesser
• Counterexamples to Borsuk's conjecture with large girth
• On simplices in diameter graphs in \(\mathbb{R}^4\)
• Around Borsuk's hypothesis
• Excursions into combinatorial geometry
• Coloring Distance Graphs and Graphs of Diameters
• Research Problems in Discrete Geometry
• Covering planar sets
• Unnamed Item
• Unnamed Item

This page was built for publication: On the partition of plane sets into 6 subsets of small diameter