Abstract
We give a lower bound for the number of vertices of a generald-dimensional polytope with a given numberm ofi-faces for eachi = 0,..., ⌎d/2⌏ − 1. The tightness of those bounds is proved using McMullen's conditions. Form greater than a small constant, those lower bounds are attained by simpliciali-neighbourly polytopes.
Similar content being viewed by others
References
Barnette, D.: The minimum number of vertices of a simple polytope,Israel J. Math. 10, (1971), 121–125.
Barnette, D.: A proof for the lower bound conjecture for convex polytopes,Pacific J. Math. 46 (1973), 349–354.
Billera, L. J. and Lee, C. W.: Sufficiency of McMullen's conditions forf-vectors of simplicial polytopes,Bull. Amer. Math. Soc. (N.S.) 2 (1980), 181–185.
Billera, L. J. and Lee, C. W.: A proof of sufficiency of McMullen's conditions forf-vectors of simplicial convex polytopes,J. Combin. Th. 31 (1981), 237–255.
Brøndsted, A.:An Introduction to Convex Polytopes, Graduate Texts in Mathematics90, Springer-Verlag, New York, Heidelberg, Berlin, 1983.
Grünbaum, B.:Convex Polytopes, Wiley, London, New York, Sydney, 1967.
McMullen, P.: The maximum numbers of faces of a convex polytope,Mathematika 17 (1970), 179–184.
McMullen, P.: The numbers of faces of simplicial polytopes,Israel J. Math. 9 (1971), 559–570.
McMullen, P. and Shephard, G. C.:Convex Polytopes and the Upper Bound Conjecture, London Mathematical Society Lecture Note Series, Vol. 3. Cambridge University Press, Cambridge, 1971.
Motzkin, T. S.: Comonotone curves and polyhedra. Abstract 111,Bull. Amer. Math. Soc. 63 (1957), 35.
Stanley, R. P.: The number of faces of a simplicial convex polytope,Adv. Math. 35 (1980), 236–238.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Deza, A., Fukuda, K. McMullen's conditions and some lower bounds for general convex polytopes. Geom Dedicata 52, 165–173 (1994). https://doi.org/10.1007/BF01263604
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01263604