{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\n**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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "7AE1E7XBSF"
    ],
    "kind": "concept",
    "name": "Graph flattenability",
    "same_as": {
      "wikidata": "Q111955002",
      "wikipedia": "Graph flattenability"
    },
    "sources": [
      {
        "locator": "Graph flattenability",
        "mention": "wikipedia://en/66487331",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:66487331@r1272070201"
      }
    ],
    "tag": "14H6KYS0PC"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/14H6KYS0PC/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/14H6KYS0PC.md",
  "msc": null,
  "name": "Graph flattenability",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/14H/14H6KYS0PC.md",
  "status": null,
  "tag": "14H6KYS0PC",
  "uri": "m2://14H6KYS0PC",
  "url": "https://math2.tamnd.com/wiki/graph-flattenability/",
  "writing": {
    "tag": "14H6KYS0PC",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}