A generalized lower‐bound conjecture for simplicial polytopes

DOI10.1112/S0025579300005520zbMath0233.52003WikidataQ123229616 ScholiaQ123229616MaRDI QIDQ5641742

Peter McMullen, David W. Walkup

Publication date: 1971

Published in: Mathematika (Search for Journal in Brave)

Mathematics Subject Classification ID

52B11: (n)-dimensional polytopes

Related Items

Polytopes, graphs, and complexes, Rigidity and the lower bound theorem. I, Neighborly 6-polytopes with 10 vertices, A new basis of polytopes, On \(k\)-stacked polytopes, P.l. homeomorphic manifolds are equivalent by elementary shellings, \(g\)-elements, finite buildings and higher Cohen-Macaulay connectivity., Genocchi numbers and \(f\)-vectors of simplicial balls, Lower bound theorem for normal pseudomanifolds, Lattice points in lattice polytopes, A lower bound theorem for polytope pairs, Many triangulated spheres, A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes, The number of faces of polytope pairs and unbounded polyhedra, Equidecomposable and weakly neighborly polytopes, On simple polytopes, Neighborly cubical spheres and a cubical lower bound conjecture, Combinatorics of polytopes with a group of linear symmetries of prime power order, A homological interpretation of skeletal ridigity, The extended f-vectors of 4-polytopes, P.L.-spheres, convex polytopes, and stress, The numbers of faces of simplicial polytopes, Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes

Cites Work

• Sulla caratteristica dei complessi simpliciali \(\chi\)-omogenei
• On the upper-bound conjecture for convex polytopes
• The lower bound conjecture for 3- and 4-manifolds
• The numbers of faces of simplicial polytopes
• The minimum number of vertices of a simple polytope
• A Generalization of Radon's Theorem
• A Combinatorial Analogue of Poincaré's Duality Theorem
• The Minimum Number of Facets of a Convex Polytope
• Polytopes, graphs, and complexes