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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. graph theoryA 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

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

Full word history & related roots →
Cite this entry
APA

Menger's theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Menger's%20theorem

MLA

“Menger's theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Menger's%20theorem. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Menger's theorem,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Menger's%20theorem.

Source: Menger's theorem on Wiktionary, CC BY-SA 4.0.