|
This article is cited in 7 scientific papers (total in 7 papers)
Covering sets in $\mathbb{R}^m$
V. P. Filimonov Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
Abstract:
The paper investigates questions related to Borsuk's classical problem of partitioning a set in Euclidean space into subsets of smaller diameter, as well as to the well-known Nelson-Erdős-Hadwiger problem on the chromatic number of a Euclidean space.
The results of the work are obtained using combinatorial and geometric methods alike. A new approach to the investigation of such problems is suggested; it leads to a collection of results which significantly improve all results known so far.
Bibliography: 58 titles.
Keywords:
chromatic number, Borsuk's problem, diameter of a set, covering of a plane set, universal covering sets and systems.
Received: 16.12.2013
Citation:
V. P. Filimonov, “Covering sets in $\mathbb{R}^m$”, Mat. Sb., 205:8 (2014), 95–138; Sb. Math., 205:8 (2014), 1160–1200
Linking options:
https://www.mathnet.ru/eng/sm8316https://doi.org/10.1070/SM2014v205n08ABEH004414 https://www.mathnet.ru/eng/sm/v205/i8/p95
|
Statistics & downloads: |
Abstract page: | 427 | Russian version PDF: | 184 | English version PDF: | 20 | References: | 55 | First page: | 30 |
|