On the multiple Borsuk numbers of sets
From MaRDI portal
Publication:2017114
DOI10.1007/S11856-013-0048-1zbMATH Open1304.52013arXiv1206.0892OpenAlexW3098951462MaRDI QIDQ2017114FDOQ2017114
Authors: Mihály Hujter, Zsolt Lángi 
Publication date: 25 June 2014
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Abstract: The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to generalize this notion in the following way: The k-fold Borsuk number of such a set S is the smallest value of m such that there is a k-fold cover of S with m sets of diameters less than d. In this paper we characterize the k-fold Borsuk numbers of sets in the Euclidean plane, give bounds for those of centrally symmetric sets, smooth bodies and convex bodies of constant width, and examine them for finite point sets in the Euclidean 3-space.
Full work available at URL: https://arxiv.org/abs/1206.0892
Recommendations
- On multiple Borsuk numbers in normed spaces
- Borsuk number for planar convex bodies
- The Borsuk conjecture holds for bodies of revolution
- Borsuk covering and planar sets with unique completion
- Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
- Around Borsuk's hypothesis
- A counterexample to Borsuk’s conjecture
- scientific article; zbMATH DE number 718861
- On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces
Cites Work
- Around Borsuk's hypothesis
- Excursions into combinatorial geometry
- A counterexample to Borsuk’s conjecture
- The problems of Borsuk and Grunbaum on lattice polytopes
- Title not available (Why is that?)
- On a bound in Borsuk's problem
- Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
- Ball polytopes and the Vázsonyi problem
- n-tuple colorings and associated graphs
- Title not available (Why is that?)
- Fractional chromatic numbers of cones over graphs
- Several parameters of generalized Mycielskians
- Überdeckung einer Menge durch Mengen kleineren Durchmessers
- Some properties of graphs of diameters
- Zum Borsukschen Zerteilungsproblem
- Isoperimetric ratios of Reuleaux polygons
- Reuleaux polytopes
- A new proof of Vázsonyi's conjecture
- Title not available (Why is that?)
- Mitteilung betreffend meine Note: Überdeckung einer Menge durch Mengen kleineren Durchmessers
- Symmetrical sets of constant width and their partitions
- Multi-coloring the Mycielskian of graphs
- Note on a conjecture of Toft
Cited In (6)
- Title not available (Why is that?)
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- On Boltyanski and Gohberg's partition conjecture
- Borsuk's partition problem and finite point sets
- Borsuk covering and planar sets with unique completion
- On \(k\)-diametral point configurations in Minkowski spaces
This page was built for publication: On the multiple Borsuk numbers of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017114)
