{
  "aliases": [
    "folding-number",
    "minimum-cut-linear-arrangement"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, the **cutwidth** of an undirected graph is the smallest [[integer|0C4JS9RF5M]] $k$ with the following property: there is an ordering of the vertices of the graph, such that every cut obtained by partitioning the vertices into earlier and later subsets of the ordering is crossed by at most $k$ edges. That is, if the vertices are numbered $v_1,v_2,\\dots v_n$, then for every $\\ell=1,2,\\dots n-1$, the number of edges $v_iv_j$ with $i\\le\\ell$ and $j\u003e\\ell$ is at most $k$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "folding-number",
      "minimum-cut-linear-arrangement"
    ],
    "inventory": [
      "88JPSVA1WH"
    ],
    "kind": "concept",
    "name": "Cutwidth",
    "same_as": {
      "wikidata": "Q110772608",
      "wikipedia": "Cutwidth"
    },
    "sources": [
      {
        "locator": "Cutwidth",
        "mention": "wikipedia://en/69798178",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:69798178@r1329655861"
      }
    ],
    "tag": "C10J2S8JB0"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/C10J2S8JB0/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/C10J2S8JB0.md",
  "msc": null,
  "name": "Cutwidth",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/C10/C10J2S8JB0.md",
  "status": null,
  "tag": "C10J2S8JB0",
  "uri": "m2://C10J2S8JB0",
  "url": "https://math2.tamnd.com/wiki/cutwidth/",
  "writing": {
    "tag": "C10J2S8JB0",
    "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
      }
    ]
  }
}