Skip to content
← All questions

How do you turn a complete graph into a simplex?

You interpret a complete graph as a simplex by keeping its vertices and edges, then filling in higher-dimensional cells such as 2-dimensional triangular faces, 3-dimensional solids, and 4-dimensional spaces. A complete graph on k vertices forms a(k−1)a (k-1)-simplex.

Conditions

  • The starting structure is a complete graph on k vertices.
  • Higher-dimensional cells are filled successively between existing lower-dimensional ones.

Reasoning, step by step

  1. Begin with a complete graph where every vertex is connected to every other vertex by an edge.
  2. Interpret the vertices and edges as the 0- and 1-dimensional parts of a simplex.
  3. Add 2-dimensional triangular faces between the edges.
  4. Add 3-dimensional solids between the faces.
  5. Continue adding higher-dimensional spaces.
  6. Conclude that the complete graph on k vertices forms a(k−1)a (k-1)-simplex.

Example

The complete graph on k vertices will form a k minus 1 simplex. So it's k minus 1 dimensional.

Common misconceptions

  • Thinking a complete graph stops at vertices and pairwise edges once interpreted geometrically.
  • Assuming the dimension of the resulting simplex is k instead of k-1.

Watch the explanation

Connected concepts

Explore next

Related questions

Meet the concept

↗
Meet the concept

↗
Meet the concept

↗
Understand why

↗
Find a method

↗

Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.