Menger's theorem
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.Proved by Karl Menger in 1927, it characterizes the connectivity of a graph.It is generalized by the max-flow min-cut theorem, which is a weighted, edge version, and which in turn is a special case of the strong duality theorem for linear programs.
known for
Wikipage disambiguates
Barrier resilienceConnectivity (graph theory)Erdős-Menger conjectureErdős–Menger conjectureGammoidHall's marriage theoremJanuary 1902K-connectivity certificateK-edge-connected graphK-vertex-connected graphKarl MengerList of Austrian scientistsList of Israeli inventions and discoveriesList of conjectures by Paul ErdősList of network theory topicsList of theoremsList of unsolved problems in mathematicsMax-flow min-cut theoremMengerMenger's TheoremMenger's n-arc theoremMenger theoremMengers theoremNash-Williams theoremPlanar separator theoremPlünnecke–Ruzsa inequalityRon AharoniRudolf HalinSperner familyStrong orientationStructural cohesion
Link from a Wikipage to another Wikipage
known for
seeAlso
primaryTopic
Menger's theorem
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.Proved by Karl Menger in 1927, it characterizes the connectivity of a graph.It is generalized by the max-flow min-cut theorem, which is a weighted, edge version, and which in turn is a special case of the strong duality theorem for linear programs.
has abstract
Em teoria dos grafos e áreas r ...... r par de nós x, y no subgrafo.
@pt
En théorie des graphes, le thé ...... rouvé par Karl Menger en 1927.
@fr
In the mathematical discipline ...... y theorem for linear programs.
@en
Теорема Менгера — основной рез ...... 27 году Карлом Менгером (мл.).
@ru
メンガーの定理(メンガーのていり、英: Menger's t ...... が証明されている(ポール・エルデシュが最初に推測していた)。
@ja
在图论中,门格尔定理(英:Menger's Theorem) ...... 定理,而最大流量小割定理是線性規劃的强对偶性定理的直接推論。
@zh
그래프 이론의 수학적 분야인 멩거의 정리에서는 유한 그 ...... 하여 추측한다면 이것은 에르되시-멩거 추측이라고 한다.
@ko
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,021,355,974
Link from a Wikipage to another Wikipage
bot
InternetArchiveBot
@en
date
March 2020
@en
fix-attempted
yes
@en
wikiPageUsesTemplate
hypernym
comment
Em teoria dos grafos e áreas r ...... de funciona da seguinte forma:
@pt
En théorie des graphes, le thé ...... rouvé par Karl Menger en 1927.
@fr
In the mathematical discipline ...... y theorem for linear programs.
@en
Теорема Менгера — основной рез ...... 27 году Карлом Менгером (мл.).
@ru
メンガーの定理(メンガーのていり、英: Menger's t ...... が証明されている(ポール・エルデシュが最初に推測していた)。
@ja
在图论中,门格尔定理(英:Menger's Theorem) ...... 定理,而最大流量小割定理是線性規劃的强对偶性定理的直接推論。
@zh
그래프 이론의 수학적 분야인 멩거의 정리에서는 유한 그 ...... 하여 추측한다면 이것은 에르되시-멩거 추측이라고 한다.
@ko
label
Menger's theorem
@en
Satz von Menger
@de
Teorema de Menger
@pt
Théorème de Menger
@fr
Теорема Менгера
@ru
メンガーの定理
@ja
门格尔定理
@zh
멩거의 정리
@ko