Menger's theorem

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

In the mathematical discipline of graph theory, Menger's theorem says that in a finite graph, the size of a minimum cut set is equal to the maximum number of disjoint paths that can be found between any pair of vertices.

Excerpt from the Wikipedia article “Menger's theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia