Abstract
The graph of everyd-dimensional convex polytope isd-connected and contains a refinement of the complete graph ond+1 vertices. These two theorems are generalized to pseudomanifolds and to some very general decompositions of homology manifolds.
Similar content being viewed by others
References
D. Barnette,Graph theorems for manifolds, Israel J. Math.16 (1973), 62–72.
D. Barnette,Diagrams and Schlegel Diagrams, Combinatorial Structures and their Applications, Gordon and Breach, 1970.
D. Barnette,Generalized combinatorial cells and facet splitting, Pacific J. Math.57 (1975), 33–45.
S. Cairns,Introductory Topology, Ronald Press, 1961.
V. Klee,A property of d-polyhedral graphs, J. Math. Anal. Appl.13 (1964), 1039–1042.
D. Larman and P. Mani,On the existence of certain configurations within graphs and 1-skeletons of polytopes, Proc. London Math. Soc.20 (1970), 144–160.
G. T. Sallee,Incidence graphs of polytopes, J. Combinatorial Theory2 (1967), 466–506.
E. Steinitz and H. Rademacher,Vorlesungen über die Theorie der Polyeder, Berlin, 1934.
Author information
Authors and Affiliations
Additional information
Research supported by N.S.F. Grant #MPS-74-04830/1.
Rights and permissions
About this article
Cite this article
Barnette, D. Decompositions of homology manifolds and their graphs. Israel J. Math. 41, 203–212 (1982). https://doi.org/10.1007/BF02771721
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02771721