|
This article is cited in 3 scientific papers (total in 3 papers)
MATHEMATICS
Covering planar sets
A. D. Tolmachev, D. S. Protasov Moscow Institute of Physics and Technology (National Research University), Moscow, Russia
Abstract:
Methods for improving upper and lower bounds for various coverings of planar sets are proposed. New bounds for various numbers of partition constituents are presented, and suggestions for the generalization of the presented methods are offered.
Keywords:
Borsuk problem, diameter of a set, coverings of planar sets, universal covering systems, chromatic number.
Citation:
A. D. Tolmachev, D. S. Protasov, “Covering planar sets”, Dokl. RAN. Math. Inf. Proc. Upr., 499 (2021), 44–48; Dokl. Math., 104:1 (2021), 196–199
Linking options:
https://www.mathnet.ru/eng/danma188 https://www.mathnet.ru/eng/danma/v499/p44
|
Statistics & downloads: |
Abstract page: | 89 | Full-text PDF : | 17 | References: | 16 |
|