---
tag: 14H6KYS0PC
kind: concept
name: Graph flattenability
sources:
  - wikipedia: en:66487331@r1272070201
    locator: Graph flattenability
    note: adopted
    mention: wikipedia://en/66487331
    sections: [Summary]
same_as:
  wikidata: Q111955002
  wikipedia: Graph flattenability
inventory: [7AE1E7XBSF]
---

## Summary

**Flattenability** in some $d$-dimensional [[normed vector space|00A0RPAQ8A]] is a property of [[graphs|00C0BR7D7H]] which states that any embedding, or drawing, of the graph in some high dimension $d'$ can be "flattened" down to live in $d$-dimensions, such that the distances between pairs of points connected by edges are preserved. A graph $G$ is $d$-flattenable if every distance constraint system (DCS) with $G$ as its constraint graph has a $d$-dimensional framework. Flattenability was first called realizability, but the name was changed to avoid confusion with a graph having *some* DCS with a $d$-dimensional framework.