scientific article; zbMATH DE number 3812415

MaRDI QIDQ3660447zbMATH OpenFDO

Authors Marek Lassak

Publication date 1982

zbMATH Keywords

Borsuk partition problemcoveringdiameterpartitionuniversal cover

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cited in

(17)

• The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets
• Borsuk covering and planar sets with unique completion
• The Borsuk conjecture holds for bodies of revolution
• The Borsuk partition problem: the seventieth anniversary
• Partition of three-dimensional sets into five parts of smaller diameter
• Partition bounded sets into sets having smaller diameters
• Borsuk's partition conjecture
• On Borsuk's conjecture for two-distance sets
• Around Borsuk's hypothesis
• On \(k\)-diametral point configurations in Minkowski spaces
• A counterexample to Borsuk’s conjecture
• On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces
• Borsuk's problem, Boltyanski's illumination problem, and circumradius
• Interview with Andrei Raigorodskii
• On Boltyanski and Gohberg's partition conjecture
• On two-distance (0,1)-counterexamples to Borsuk's conjecture in l_p metrics
• On upper bounds for the number of parts in the problem of partitioning sets into parts of smaller diameter

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 Q3660447)