The minimum number of vertices of a simple polytope

作者: David W. Barnette

DOI: 10.1007/BF02771522

关键词:

摘要: Ad-polytope is ad-dimensional set that the convex hull of a finite number points. simple provided each vertex meets exactlyd edges. It has been conjectured for polytopes {fx121-1} wheref i ofi-dimensional faces polytope. In this paper we show inequality (i) holds all polytopes.

参考文章(1)
G.T. Sallee, Incidence graphs of convex polytopes Journal of Combinatorial Theory, Series A. ,vol. 2, pp. 466- 506 ,(1967) , 10.1016/S0021-9800(67)80056-5