Solution of Hadwiger-Levi's covering problem for duals of cyclic \(2k\)-polytopes
From MaRDI portal
Publication:1282288
DOI10.1023/A:1005003719969zbMath0928.52005OpenAlexW52080273MaRDI QIDQ1282288
Publication date: 22 April 1999
Published in: Geometriae Dedicata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005003719969
(n)-dimensional polytopes (52B11) Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (3)
Improved bounds for Hadwiger's covering problem via thin-shell estimates ⋮ On the multiple illumination numbers of convex bodies ⋮ A quantitative program for Hadwiger's covering conjecture
This page was built for publication: Solution of Hadwiger-Levi's covering problem for duals of cyclic \(2k\)-polytopes