On the upper-bound conjecture for convex polytopes
From MaRDI portal
(Redirected from Publication:2531789)
Cites work
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- A Combinatorial Analogue of Poincaré's Duality Theorem
- On The Number of Faces of a Convex Polytope
- On the Number of Vertices of a Convex Polytope
- Polynomials Associated with Finite Gell-Complexes
- Some Results on the Upper Bound Conjecture for Convex Polytopes
- The maximum numbers of faces of a convex polytope
- The number of faces of simplicial polytopes
Cited in
(21)- Faces and duality in convex cones
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- A generalized lower‐bound conjecture for simplicial polytopes
- Vertex classification of planar \(C\)-polygons
- The vertices of the knapsack polytope
- Directed simplices in higher order tournaments
- Eulerian stratification of polyhedra
- On a problem of Klee concerning convex polytopes
- On a class of generalized simplices
- The number of simplicial neighbourly d ‐polytopes with d +3 vertices
- The number of neighbourly d ‐polytopes with d +3 vertices
- Convex polytopes with convex nets
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- Sections and projections of convex polytopes
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets
- (Deterministic) algorithms that compute the volume of polytopes
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
- Random walks on polytopes of constant corank
- Polyhedral diagrams for sections of the non‐negative orthant
- Polytopes, graphs, and complexes
This page was built for publication: On the upper-bound conjecture for convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2531789)
