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

DOI10.1023/A:1004965512469MaRDI QIDQ1376482zbMATH OpenOpenAlexFDO

Authors Károly Bezdek, T. 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

covering by smaller homothetic copiesdual cyclic polytopesseparation by hyperplanes

Mathematics Subject Classification ID

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

Recommendations

• Solution of Hadwiger-Levi's covering problem for duals of cyclic \(2k\)-polytopes
• scientific article; zbMATH DE number 431991
• Two equivalent forms of Hadwiger's covering conjecture

Cited in

(13)

• Solution of Hadwiger-Levi's covering problem for duals of cyclic \(2k\)-polytopes
• Hadwiger's covering conjecture and low dimensional dual cyclic polytopes
• The covering radius and a discrete surface area for non-hollow simplices
• Improved bounds for Hadwiger's covering problem via thin-shell estimates
• Cube is a strict local maximizer for the illumination number
• Simplicial neighbourly 5-polytopes with nine vertices
• scientific article; zbMATH DE number 431991 (Why is no real title available?)
• Two equivalent forms of Hadwiger's covering conjecture
• Covering by homothets and illuminating convex bodies
• On the multiple illumination numbers of convex bodies
• A quantitative program for Hadwiger's covering conjecture
• Towards Hadwiger's conjecture via Bourgain slicing
• Separation in totally-sewn 4-polytopes with the decreasing universal edge property

This page was built for publication: A proof of Hadwiger's covering conjecture for dual cyclic polytopes

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