{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $G$ be a finite [[graph|0JD5C82QMB]], and let $u$ and $v$ be distinct vertices of $G$.\nTwo $u$–$v$ [[paths|0JDE56HWQ8]] are internally disjoint if they have no vertex in common other than $u$ and $v$.\nA set $S$ of vertices or edges separates $u$ from $v$ if every $u$–$v$ path meets $S$.\n\n1. Suppose that $u$ and $v$ are not adjacent. Consider the sets of vertices, other than $u$ and $v$, that separate $u$ from $v$. The least size of such a set equals the greatest number of pairwise internally disjoint $u$–$v$ paths.\n2. The least size of a set of edges that separates $u$ from $v$ equals the greatest number of pairwise edge-disjoint $u$–$v$ paths.\n\n## Remarks\n\nIn both parts, the inequality \"at least\" is easy: each separating set must contain a vertex or edge from each of the disjoint paths.\nThe other inequality can be proved by induction on the number of edges.\nIt also follows from the [[max-flow min-cut theorem|4HMR4KQ01T]], with capacity $1$ on each edge or each vertex and integral flows.\nIn part 1 the hypothesis that $u$ and $v$ are not adjacent is needed: if $uv$ is an edge, no set of other vertices separates $u$ from $v$.\nFor example, in the cycle $C_6$ two opposite vertices are joined by two internally disjoint paths, and removing one inner vertex from each of these paths separates them.\nA global form, due to Whitney, follows.\nA graph with more than $k$ vertices is [[$k$-vertex-connected|7FZB7YYBXA]] if and only if every two distinct vertices are joined by $k$ internally disjoint paths.\n\n## Explanations\n\n### L1 human\n\nThink of a road map and two towns.\nCount the fewest roads you must close to cut one town off from the other.\nCount the most routes between the two towns that share no road.\nMenger's theorem says that these two numbers are always equal.\n\n### L2 human\n\nMenger's theorem is the basic min-max theorem of graph connectivity.\nIt turns the definition of $k$-connectivity, which is about removing vertices, into a statement about disjoint paths, which is often easier to use.\nIt is a special case of max-flow min-cut, and it is equivalent in strength to [[Kőnig's theorem|0JP0ZF57PN]] and [[Hall's marriage theorem|08WCB90WND]] on bipartite matchings.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "about": [
      "0JDE56HWQ8",
      "7FZB7YYBXA"
    ],
    "kind": "statement",
    "msc": [
      "05C40",
      "05C38"
    ],
    "name": "Menger's theorem",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q928813",
      "wikipedia": "Menger's theorem"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Menger's_theorem"
      }
    ],
    "tag": "E6GYGZDBS7",
    "uses": [
      "0JD5C82QMB",
      "0JDE56HWQ8",
      "7FZB7YYBXA"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/E6GYGZDBS7/",
  "links": [
    {
      "field": "about",
      "target": "0JDE56HWQ8"
    },
    {
      "field": "about",
      "target": "7FZB7YYBXA"
    },
    {
      "field": "uses",
      "target": "0JD5C82QMB"
    },
    {
      "field": "uses",
      "target": "0JDE56HWQ8"
    },
    {
      "field": "uses",
      "target": "7FZB7YYBXA"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/E6GYGZDBS7.md",
  "msc": [
    "05C40",
    "05C38"
  ],
  "name": "Menger's theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/E6G/E6GYGZDBS7.md",
  "status": null,
  "tag": "E6GYGZDBS7",
  "uri": "m2://E6GYGZDBS7",
  "url": "https://math2.tamnd.com/wiki/mengers-theorem/",
  "writing": {
    "tag": "E6GYGZDBS7",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}