Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-23T05:34:33.089Z Has data issue: false hasContentIssue false

The number of neighbourly d-polytopes with d+3 vertices

Published online by Cambridge University Press:  26 February 2010

P. McMullen
Affiliation:
University College London
Get access

Extract

Abstract. In this paper is proved a formula for the number of neighbourly d-polytopes with d + 3 vertices, when d is odd.

Type
Research Article
Copyright
Copyright © University College London 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Altshuler, A. and McMullen, P., 1973. “The number of simplicial neighbourly d-polytopes with d+3 vertices,” Mathematika, 20 (1973), 263266.CrossRefGoogle Scholar
Grönbaum, B., 1967. Convex polytopes (Wiley and Sons, London-New York-Sydney, 1967).Google Scholar
McMullen, P. and Shephard, G. C., 1971. Convex polytopes and the upper bound conjecture, London Math Soc. Lecture Notes Series, Vol. 3 (Cambridge University Press, 1971).Google Scholar