Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-25T04:19:45.392Z Has data issue: false hasContentIssue false
  • English
  • Français

A New Proof of the d-Connectedness of d-Polytopes

Published online by Cambridge University Press:  20 November 2018

A. Brøndsted  and
G. Maxwell
A. Brøndsted
Affiliation:
A. Brøndsted, Institute of Mathematics, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen Ø, Denmark
G. Maxwell
Affiliation:
G. Maxwell, Department of Mathematics, University of British Columbia, 121-1984 Mathematics Road, Vancouver, B.C., Canada V6T 1Y4
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Balinski has shown that the graph of a d-polytope is d-connected. In this note we give a new proof of Balinski's theorem.

Keywords

1. 52A252. 05C40Convex polytopegraphd-connected
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 32 , Issue 2 , 01 June 1989 , pp. 252 - 254
Copyright
Copyright © Canadian Mathematical Society 1989

References

1. Balinski, M., On the graph structure of convex polyhedra in n-space, Pacific J. Math. 11 (1961), 431-434.Google Scholar
2. Brondsted, A., “An introduction to convex polytopes,” Springer-Verlag, New York-Heidelberg-Berlin, 1983.Google Scholar
3. Griinbaum, B., “Convex polytopes,” John Wiley & Sons, London-New York-Sydney, 1967.Google Scholar