Every edge is shared by three or more faces in a4-polytope, as seen in this projection of atesseract.
Ingeometry, anedge is a particular type ofline segment joining twovertices in apolygon,polyhedron, or higher-dimensionalpolytope.[1] In a polygon, an edge is a line segment on the boundary,[2] and is often called apolygon side. In a polyhedron or more generally a polytope, an edge is a line segment where twofaces (or polyhedron sides) meet.[3] A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called adiagonal.
Ingraph theory, anedge is an abstract object connecting twograph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment.However, any polyhedron can be represented by itsskeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges.[6] Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized bySteinitz's theorem as being exactly the3-vertex-connectedplanar graphs.[7]
whereV is the number ofvertices,E is the number of edges, andF is the number offaces. This equation is known asEuler's polyhedron formula. Thus the number of edges is 2 less than the sum of the numbers of vertices and faces. For example, acube has 8 vertices and 6 faces, and hence 12 edges.
In a polygon, two edges meet at eachvertex; more generally, byBalinski's theorem, at leastd edges meet at every vertex of ad-dimensional convex polytope.[8]Similarly, in a polyhedron, exactly two two-dimensional faces meet at every edge,[9] while in higher dimensional polytopes three or more two-dimensional faces meet at every edge.
In the theory of high-dimensionalconvex polytopes, afacet orside of ad-dimensionalpolytope is one of its (d − 1)-dimensional features, aridge is a (d − 2)-dimensional feature, and apeak is a (d − 3)-dimensional feature. Thus, the edges of a polygon are its facets, the edges of a 3-dimensionalconvex polyhedron are its ridges, and the edges of a4-dimensional polytope are its peaks.[10]
^Pisanski, Tomaž;Randić, Milan (2000), "Bridges between geometry and graph theory", in Gorini, Catherine A. (ed.),Geometry at work, MAA Notes, vol. 53, Washington, DC: Math. Assoc. America, pp. 174–194,MR1782654. See in particular Theorem 3,p. 176.