{
  "id": "enwiki-001377768048",
  "slug": "edge-geometry",
  "title": "Edge (geometry)",
  "qid": "",
  "lead": "In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces (or polyhedron sides) meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. An edge may also be an infinite line separating two half-planes. The sides of a plane angle are semi-infinite half-lines (or rays).",
  "body": "In geometry, an edge is a particular type of line segment joining two vertices in a polygon, polyhedron, or higher-dimensional polytope. In a polygon, an edge is a line segment on the boundary, and is often called a polygon side. In a polyhedron or more generally a polytope, an edge is a line segment where two faces (or polyhedron sides) meet. A segment joining two vertices while passing through the interior or exterior is not an edge but instead is called a diagonal. An edge may also be an infinite line separating two half-planes. The sides of a plane angle are semi-infinite half-lines (or rays). ==Relation to edges in graphs== In graph theory, an edge is an abstract object connecting two graph vertices, unlike polygon and polyhedron edges which have a concrete geometric representation as a line segment. However, any polyhedron can be represented by its skeleton or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges. Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by Steinitz's theorem as being exactly the 3-vertex-connected planar graphs. ==Number of edges in a polyhedron== Any convex polyhedron's surface has Euler characteristic V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of edges is 2 less than the sum of the numbers of vertices and faces. For example, a cube has 8 vertices and 6 faces, and hence 12 edges. ==Incidences with other faces== In a polygon, two edges meet at each vertex; more generally, by Balinski's theorem, at least d edges meet at every vertex of a d-dimensional convex polytope. Similarly, in a polyhedron, exactly two two-dimensional faces meet at every edge, while in higher dimensional polytopes three or more two-dimensional faces meet at every edge. ==Alternative terminology== In the theory of high-dimensional convex polytopes, a facet or side of a d-dimensional polytope is one of its (d&nbsp;−&nbsp;1)-dimensional features, a ridge is a (d&nbsp;−&nbsp;2)-dimensional feature, and a peak is a (d&nbsp;−&nbsp;3)-dimensional feature. Thus, the edges of a polygon are its facets, the edges of a 3-dimensional convex polyhedron are its ridges, and the edges of a 4-dimensional polytope are its peaks. ==See also== Base (geometry) Extended side ==References== ==External links==",
  "categories": [
    "20186449",
    "20476462",
    "23603337",
    "26220375",
    "29176564",
    "44446176"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1377768048",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1790811309.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001377768048",
    "type": "webpage",
    "title": "Edge (geometry)",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/edge-geometry",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          17
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          17
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001377768048",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1377768048",
    "note": "Immutable snapshot enwiki-001377768048"
  }
}