Skip to main content
Log in

Facets with fewest vertices

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

Abstract

Forv>d≧3, letm(v, d) be the smallest numberm, such that every convexd-polytope withv vertices has a facet with at mostm vertices. In this paper, bounds form(v, d) are found; in particular, for fixedd≧3,

$$\frac{{r - 1}}{r} \leqslant \mathop {\lim \inf }\limits_{\upsilon \to \infty } \frac{{m(\upsilon ,d)}}{\upsilon } \leqslant \mathop {\lim \sup }\limits_{\upsilon \to \infty } \frac{{m(\upsilon ,d)}}{\upsilon } \leqslant \frac{{d - 3}}{{d - 2}}$$

, wherer=[1/3(d+1)].

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

References

  1. Blind, G., Blind, R.: Über die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-Seiten. Mh. Math.98, 179–184 (1984).

    Google Scholar 

  2. Grünbaum, B.: Convex Polytopes. Wiley-Interscience. 1967.

  3. Kalai, G.: On low-dimensional faces that high-dimensional polytopes must have. Combinatorica10 (1990) (to be published).

  4. Shephard, G. C.: Diagrams for positive bases. J. London Math. Soc. (2)4, 165–175 (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bezdek, A., Bezdek, K., Makai, E. et al. Facets with fewest vertices. Monatshefte für Mathematik 109, 89–96 (1990). https://doi.org/10.1007/BF01302928

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Navigation