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,
, wherer=[1/3(d+1)].
Similar content being viewed by others
References
Blind, G., Blind, R.: Über die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-Seiten. Mh. Math.98, 179–184 (1984).
Grünbaum, B.: Convex Polytopes. Wiley-Interscience. 1967.
Kalai, G.: On low-dimensional faces that high-dimensional polytopes must have. Combinatorica10 (1990) (to be published).
Shephard, G. C.: Diagrams for positive bases. J. London Math. Soc. (2)4, 165–175 (1971).
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01302928