{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Problem\n\nThe **bipartite realization problem** is a classical decision problem in graph theory, a branch of [[combinatorics|0JKW7W7XFR]]. Given two finite sequences $(a_1,\\dots,a_n)$ and $(b_1,\\dots,b_m)$ of [[natural numbers|0MWKJ44V5A]] with $m\\leq n$, the problem asks whether there is a labeled simple [[bipartite graph|07DVHJ8N0A]] such that $(a_1,\\dots,a_n), (b_1,\\dots,b_m)$ is the [[degree sequence|07DVHJ8N0A]] of this bipartite graph.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "4T83KJK73Y"
    ],
    "kind": "problem",
    "name": "Bipartite realization problem",
    "same_as": {
      "wikidata": "Q18206555",
      "wikipedia": "Bipartite realization problem"
    },
    "sources": [
      {
        "locator": "Bipartite realization problem",
        "mention": "wikipedia://en/43264877",
        "note": "adopted",
        "sections": [
          "Problem"
        ],
        "wikipedia": "en:43264877@r1336679097"
      }
    ],
    "tag": "13P7YE8CC8"
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/13P7YE8CC8/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/13P7YE8CC8.md",
  "msc": null,
  "name": "Bipartite realization problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/13P/13P7YE8CC8.md",
  "status": null,
  "tag": "13P7YE8CC8",
  "uri": "m2://13P7YE8CC8",
  "url": "https://math2.tamnd.com/wiki/bipartite-realization-problem/",
  "writing": {
    "tag": "13P7YE8CC8",
    "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
      }
    ]
  }
}