A proof of Hadwiger's covering conjecture for dual cyclic polytopes

DOI10.1023/A:1004965512469zbMath0965.52014OpenAlexW19158198MaRDI QIDQ1376482

Károly Bezdek, Tibor Bisztriczky

Publication date: 18 December 1997

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004965512469

zbMATH Keywords

separation by hyperplanescovering by smaller homothetic copiesdual cyclic polytopes

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

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 ⋮ HILBERT TRANSFORMS ALONG LIPSCHITZ DIRECTION FIELDS: A LACUNARY MODEL ⋮ Separation in totally-sewn 4-polytopes with the decreasing universal edge property ⋮ Cube is a strict local maximizer for the illumination number ⋮ Simplicial neighbourly 5-polytopes with nine vertices ⋮ Covering by homothets and illuminating convex bodies