Covering planar sets
Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 499 (2021), pp. 44-48
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{DANMA_2021_499_a9,
author = {A. D. Tolmachev and D. S. Protasov},
title = {Covering planar sets},
journal = {Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleni\^a},
pages = {44--48},
publisher = {mathdoc},
volume = {499},
year = {2021},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DANMA_2021_499_a9/}
}
TY - JOUR AU - A. D. Tolmachev AU - D. S. Protasov TI - Covering planar sets JO - Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ PY - 2021 SP - 44 EP - 48 VL - 499 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DANMA_2021_499_a9/ LA - ru ID - DANMA_2021_499_a9 ER -
A. D. Tolmachev; D. S. Protasov. Covering planar sets. Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 499 (2021), pp. 44-48. http://geodesic.mathdoc.fr/item/DANMA_2021_499_a9/