, the graph of a stacked polyhedron The
undirected graph formed by the vertices and edges of a stacked polytope in
d dimensions is a
(d + 1)-tree. More precisely, the graphs of stacked polytopes are exactly the (
d + 1)-trees in which every
d-vertex
clique (complete subgraph) is contained in at most two (
d + 1)-vertex cliques. For instance, the graphs of three-dimensional stacked polyhedra are exactly the
Apollonian networks, the graphs formed from a triangle by repeatedly subdividing a triangular face of the graph into three smaller triangles. One reason for the significance of stacked polytopes is that, among all
d-dimensional
simplicial polytopes with a given number of vertices, the stacked polytopes have the fewest possible higher-dimensional faces. For three-dimensional simplicial polyhedra the numbers of edges and two-dimensional faces are determined from the number of vertices by
Euler's formula, regardless of whether the polyhedron is stacked, but this is not true in higher dimensions. Analogously, the simplicial polytopes that maximize the number of higher-dimensional faces for their number of vertices are the
cyclic polytopes. ==References==