Construct · 1 fields · 1 citations

Menger's theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the result that the minimum number of vertices separating two vertices equals the maximum number of disjoint paths joining them.

In graph theory, Menger's theorem refers to the result that the minimum number of vertices separating two vertices equals the maximum number of disjoint paths joining them. This meaning comes from Menger (1927) in Fundamenta Mathematicae.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Menger's theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

connectivity5 fields · 6 citationsjingle · one word, five constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Menger, K. (1927). Zur allgemeinen Kurventheorie. Fundamenta Mathematicae, 10, 96-115. https://doi.org/10.4064/fm-10-1-96-115

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct