Separation in totally-sewn 4-polytopes with the decreasing universal edge property

DOI10.1007/s13366-011-0069-zzbMath1238.52004OpenAlexW2317116406MaRDI QIDQ664204

Deborah Oliveros, Ferenc Fodor, Tibor Bisztriczky

Publication date: 29 February 2012

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13366-011-0069-z

zbMATH Keywords

separation problemGohberg-Markus-Hadwiger covering numberneighbourly polytopetotally-sewn polytope

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Other problems of combinatorial convexity (52A37) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• Unnamed Item
• Unnamed Item
• Separation in semi-cyclic 4-polytopes
• How many cyclic subpolytopes can a non-cyclic polytope have?
• Neighborly polytopes
• Combinatorial problems on the illumination of convex bodies
• A proof of Hadwiger's covering conjecture for dual cyclic polytopes
• Hadwiger's covering conjecture and low dimensional dual cyclic polytopes
• Excursions into combinatorial geometry
• The problem of illumination of the boundary of a convex body by affine subspaces
• Separation in neighbourly 4-polytopes