Abstract
LetP be ad-polytope without triangular 2-faces,K ad-cube andf n (P),f n (K) the respective number ofn-faces. It is shown for simpleP or in dimensiond≤4 thatf n (P)≥f n (K), and for anyn equality holds if and only ifP andK are combinatorially equivalent.
Similar content being viewed by others
Literatur
Barnette, D.: The minimum number of vertices of a simple polytope. Israel J. Math.10, 121–125 (1971).
Barnette, D.: A proof of the lower bound conjecture for convex polytopes. Pacific J. Math.46, 349–354 (1973).
Billera, L. J., Lee, C. W.: A proof of the sufficiency of McMullen's conditions forf-vectors of simplicial convex polytopes. J. Combinat. Theory, Ser. A.31, 237–255 (1981).
Brøndsted, A.: An Introduction to Convex Polytopes. New York-Heidelberg-Berlin: Springer. 1983.
Grünbaum, B.: Convex Polytopes. London-New York-Sydney: Interscience Publ. 1967.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Blind, G., Blind, R. Über die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-Seiten. Monatshefte für Mathematik 98, 179–184 (1984). https://doi.org/10.1007/BF01507746
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01507746