Skip to main content
Log in

Über die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-Seiten

On the minimum number of faces of polytopes without triangular 2-faces

  • Published:
Monatshefte für Mathematik Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Literatur

  1. Barnette, D.: The minimum number of vertices of a simple polytope. Israel J. Math.10, 121–125 (1971).

    Google Scholar 

  2. Barnette, D.: A proof of the lower bound conjecture for convex polytopes. Pacific J. Math.46, 349–354 (1973).

    Google Scholar 

  3. 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).

    Google Scholar 

  4. Brøndsted, A.: An Introduction to Convex Polytopes. New York-Heidelberg-Berlin: Springer. 1983.

    Google Scholar 

  5. Grünbaum, B.: Convex Polytopes. London-New York-Sydney: Interscience Publ. 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01507746

Navigation