On the upper-bound conjecture for convex polytopes
From MaRDI portal
Publication:2531789
DOI10.1016/0095-8956(71)90042-6zbMath0172.47401OpenAlexW1968197414MaRDI QIDQ2531789
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90042-6
Related Items
Scalable branching on dual decomposition of stochastic mixed-integer programming problems, An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\), Polytopes, graphs, and complexes, Polyhedral diagrams for sections of the non‐negative orthant, A generalized lower‐bound conjecture for simplicial polytopes, Sections and projections of convex polytopes, On a class of generalized simplices, The Upper Bound Conjecture and Cohen-Macaulay Rings, Convex polytopes with convex nets, (Deterministic) algorithms that compute the volume of polytopes, Random Walks on Polytopes of Constant Corank, Faces and duality in convex cones, On a problem of Klee concerning convex polytopes, Eulerian stratification of polyhedra, DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS, The vertices of the knapsack polytope, Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets, An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves, The number of simplicial neighbourly d ‐polytopes with d +3 vertices, The number of neighbourly d ‐polytopes with d +3 vertices
Cites Work
- Unnamed Item
- On The Number of Faces of a Convex Polytope
- On the Number of Vertices of a Convex Polytope
- A Combinatorial Analogue of Poincaré's Duality Theorem
- The number of faces of simplicial polytopes
- Some Results on the Upper Bound Conjecture for Convex Polytopes
- Polynomials Associated with Finite Gell-Complexes
- The maximum numbers of faces of a convex polytope
