scientific article; zbMATH DE number 6381834

MaRDI QIDQ2934740zbMATH OpenFDO

Authors V. P. Filimonov

Publication date 19 December 2014

zbMATH Keywords

chromatic numberBorsuk's problemcovering of a plane setdiameter of a setuniversal covering sets and systems

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Recommendations

• A covering theorem for families of sets in R^d
• scientific article; zbMATH DE number 4144845
• scientific article; zbMATH DE number 1857337
• Covering Theorems with respect to the Set Function in Metric Space
• scientific article; zbMATH DE number 3446866
• scientific article; zbMATH DE number 1532398
• Covering maps of spaces of compact subsets
• scientific article; zbMATH DE number 3285212
• Covering \mathbb R with translates of a compact set

Cited in

(14)

• On the partition of plane sets into 6 subsets of small diameter
• Covering planar sets
• Combinatorial geometry and coding theory
• On dividing sets into parts of smaller diameter
• Partition bounded sets into sets having smaller diameters
• A quantitative program for Hadwiger's covering conjecture
• Real periodicity theorem for division codes
• scientific article; zbMATH DE number 177380 (Why is no real title available?)
• On covering of real line by null sets
• scientific article; zbMATH DE number 3285212 (Why is no real title available?)
• Bounds on Borsuk numbers in distance graphs of a special type
• Division codes and an area theorem
• Coverings of planar and three-dimensional sets with subsets of smaller diameter
• Diameters of the pieces in Borsuk's covering

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934740)