Graham–Pollak theorem
ID: graham-pollak-theorem
The Graham–Pollak theorem is a result in graph theory that pertains to the relationships between the edges of a complete graph and the configurations of points in Euclidean space. Specifically, it states that for a complete graph on \( n \) vertices, the number of edges that can be embedded in \( \mathbb{R}^d \) (real d-dimensional space) without any three edges crossing is limited.
New to topics? Read the docs here!