Obstructions to weak decomposability for simplicial polytopes

DOI10.1090/S0002-9939-2014-12101-0zbMath1383.52015arXiv1206.6143OpenAlexW2593473970MaRDI QIDQ3190213

Steven Klee, Nicolai Hähnle, Vincent Pilaud

Publication date: 16 September 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.6143

zbMATH Keywords

simplicial polytopes(weak) decomposability

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Combinatorial aspects of simplicial complexes (05E45)

Related Items (1)

Recent progress on the combinatorial diameter of polytopes and simplicial complexes

Cites Work

• A counterexample to the Hirsch conjecture
• An update on the Hirsch conjecture
• Signature classes of transportation polytopes
• A linear bound on the diameter of the transportation polytope
• A continuous \(d\)-step conjecture for polytopes
• An upper bound for the diameter of a polytope
• The many facets of linear programming
• Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable
• Diameter of Polyhedra: Limits of Abstraction
• The d-Step Conjecture and Its Relatives
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• The width of five-dimensional prismatoids
• Paths on Polytopes

This page was built for publication: Obstructions to weak decomposability for simplicial polytopes