Coverings of planar and three-dimensional sets with subsets of smaller diameter
From MaRDI portal
Publication:2166237
DOI10.1016/J.DAM.2022.06.016zbMath1496.52019OpenAlexW4283069053MaRDI QIDQ2166237
A. D. Tolmachev, D. S. Protasov, Vsevolod Aleksandrovich Voronov
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.06.016
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (2)
Borsuk's problem, Boltyanski's illumination problem, and circumradius ⋮ Banach-Mazur distance from \(\ell_p^3\) to \(\ell_\infty^3\)
Cites Work
- Unnamed Item
- 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
- Partition bounded sets into sets having smaller diameters
- Bounds on Borsuk numbers in distance graphs of a special type
- Borsuk's partition conjecture
- New bounds on clique-chromatic numbers of Johnson graphs
- New bounds for the clique-chromatic numbers of Johnson graphs
- On dividing sets into parts of smaller diameter
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Counterexamples to Borsuk's conjecture with large girth
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- Ramsey theory in the -space with Chebyshev metric
- Covering planar sets
- Covering planar sets
This page was built for publication: Coverings of planar and three-dimensional sets with subsets of smaller diameter
