{
  "aliases": [
    "graph-realizability"
  ],
  "backlinks": null,
  "body": "\n## Problem\n\nThe **graph realization problem** is a decision problem in graph theory. Given a finite sequence $(d_1,\\dots,d_n)$ of natural numbers, the problem asks whether there is a labeled [[simple graph|00C0BR7D7H]] such that $(d_1,\\dots,d_n)$ is the degree sequence of this graph.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "graph-realizability"
    ],
    "inventory": [
      "93P7F0HEZ9"
    ],
    "kind": "problem",
    "name": "Graph realization problem",
    "same_as": {
      "wikidata": "Q18207520",
      "wikipedia": "Graph realization problem"
    },
    "sources": [
      {
        "locator": "Graph realization problem",
        "mention": "wikipedia://en/43304622",
        "note": "adopted",
        "sections": [
          "Problem"
        ],
        "wikipedia": "en:43304622@r1298050546"
      }
    ],
    "tag": "SVX1CQ4CR2"
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/SVX1CQ4CR2/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/SVX1CQ4CR2.md",
  "msc": null,
  "name": "Graph realization problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/SVX/SVX1CQ4CR2.md",
  "status": null,
  "tag": "SVX1CQ4CR2",
  "uri": "m2://SVX1CQ4CR2",
  "url": "https://math2.tamnd.com/wiki/graph-realization-problem/",
  "writing": {
    "tag": "SVX1CQ4CR2",
    "kind": "problem",
    "level": "W1",
    "next": [
      {
        "what": "edge bounds both",
        "have": 0,
        "want": 1
      },
      {
        "what": "section History",
        "note": "with the year of the first source",
        "have": 0,
        "want": 1
      }
    ]
  }
}