Covering planar sets

DOI10.1134/S1064562421040141zbMath1478.05118OpenAlexW3201074417MaRDI QIDQ5919143

D. S. Protasov, A. D. Tolmachev

Publication date: 16 November 2021

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562421040141

zbMATH Keywords

chromatic numberBorsuk problemcoverings of planar setsdiameter of setuniversal covering systems

Mathematics Subject Classification ID

Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ Borsuk's problem, Boltyanski's illumination problem, and circumradius

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Zerlegung ebener Bereiche in konvexe Zellen von möglichst kleinem Durchmesser
• Bounds on Borsuk numbers in distance graphs of a special type
• 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
• Thirty Essays on Geometric Graph Theory
• Drei Sätze über die n-dimensionale euklidische Sphäre
• Ramsey theory in the -space with Chebyshev metric
• Covering planar sets

This page was built for publication: Covering planar sets