Word.ws English Dictionary

Menger's theorem

Menger's theorem proper noun: a characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices.

Proper noun

Menger's theorem

  1. A characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices.

Origin of Menger's theorem

It was proved for edge-connectivity and vertex-connectivity by Karl Menger in 1927.

Questions about Menger's theorem

What does Menger's theorem mean?
Menger's theorem means a characterization of the connectivity in finite undirected graphs in terms of the minimum number of disjoint paths that can be found between any pair of vertices.
What part of speech is Menger's theorem?
Menger's theorem is a proper noun.

Words near Menger's theorem in the dictionary

  1. mengenillid
  2. mengenillids
  3. Menger
  4. Menger sponge
  5. Menger sponges
  6. Menger's theorem
  7. Mengerian
  8. Mengerink
  9. Mengerinks
  10. Mengers
  11. Mengesha

Source and license

Adapted from Wiktionary: Menger's theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Menger's theorem.” Word.ws, https://word.ws/menger%27s_theorem. Based on Wiktionary, CC BY-SA 4.0.