On the \(k\)-systems of a simple polytope

DOI10.1007/BF02773157zbMath1009.52021arXivmath/0012204WikidataQ117245117 ScholiaQ117245117MaRDI QIDQ1601467

Michael Joswig, Volker Kaibel, Friederike Körner

Publication date: 4 April 2003

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic complexitysimple polytopeedge graphabstract objective function

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Long monotone paths on simple 4-polytopes, On the Monotone Upper Bound Problem, On the reconstruction of polytopes, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Efficient edge-skeleton computation for polytopes defined by oracles, Graphs, skeleta and reconstruction of polytopes, Finding a simple polytope from its graph in polynomial time

Cites Work

• Unnamed Item
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• Examples and counterexamples for the Perles conjecture
• Realization spaces of polytopes
• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
• Lectures on Polytopes
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices