Abstract
Two basic theorems about the graphs of convex polytopes are that the graph of ad-polytope isd-connected and that it contains a refinement of the complete graph ond+1 vertices. We obtain generalizations of these theorems, and others, for manifolds. We also supply some details for a proof of the lower bound inequality for manifolds.
Similar content being viewed by others
References
D. Barnette,The minimum number of vertices of a simple d-polytope, Israel J. Math.10 (1971), 121–125.
D. Barnette and G. Wegner,A 3-sphere that is not 4-polyhedral, Studia Sci. Math. Hungar.6 (1971), 341–346.
B. Grünbaum,Convex Polytopes, Wiley, New York, 1967.
V. Klee,A property of polyhedral graphs, J. Math. Mech.13 (1964), 1039–1042.
E. Moise,Affine structures in 3-manifolds, V (The triangulation theorem and hauptvermutung), Ann. of Math.56 (1952), 96–114.
E. Steinitz and H. Radamacher,Vorlesungen über die Theorie der Polyeder, Berlin, 1934.
H. Whitney,Congurent graphs and the connectivity of graphs, Amer. J. Math.54 (1932), 150–164.
Author information
Authors and Affiliations
Additional information
Research supported by NSF Grants GP 8470 and GP 19221.
Rights and permissions
About this article
Cite this article
Barnette, D. Graph theorems for manifolds. Israel J. Math. 16, 62–72 (1973). https://doi.org/10.1007/BF02761971
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02761971