Pages that link to "Item:Q4915386"
From MaRDI portal
The following pages link to Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets (Q4915386):
Displaying 15 items.
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers (Q848679) (← links)
- Upper bounds for the diameter and height of graphs of convex polyhedra (Q1196197) (← links)
- Polyhedral results for the edge capacity polytope. (Q1611010) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- On the Holt-Klee property for oriented matroid programming (Q2065995) (← links)
- A proof of the strict monotone 5-step conjecture (Q2225660) (← links)
- Enumerating Neighborly Polytopes and Oriented Matroids (Q3194584) (← links)
- On the Determination of Minimal Facets and Edges of a Polyhedral Set (Q4368582) (← links)
- Topological Prismatoids and Small Simplicial Spheres of Large Diameter (Q5094480) (← links)
- The width of five-dimensional prismatoids (Q5245200) (← links)
- More bounds on the diameters of convex polytopes (Q5299904) (← links)