In a finite graph, the maximum number of pairwise vertex-disjoint paths between two non-adjacent vertices equals the minimum number of vertices whose removal disconnects them. Proved by Karl Menger, it is a foundational connectivity result of graph theory, later shown to be a special case of the max-flow min-cut theorem.
Facts
StatementIn 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. 2 Classification
Statement Form Menger's Theorem
Filter Results1 entry
Connections
Has Statement Form
In Branch
Principal Result Of
Source Wikipedia: Karl Menger
Proved By
Source Menger's Theorem (Wikipedia)
Sources
1. Wikipedia: Menger's theorem
WikipediaLead section, statement-form referenceQuote, Lead section, statement-form reference
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.
2. Menger's Theorem (Wikipedia)
Wikimedia FoundationLead section, first sentence
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.
Lead section, second sentence
Proved by Karl Menger in 1927, it characterizes the connectivity of a graph.
Proved By: Karl Menger, Lead
Proved by Karl Menger in 1927, it characterizes the connectivity of a graph.
In Group: Graph Theory, Lead section
In the mathematical discipline of graph theory, Menger's theorem says that in a finite graph
View the Source Wikipedia: Karl Menger
Principal Result Of: Karl Menger, Article textQuote, Principal Result Of: Karl Menger, Article text
In graph theory, he is credited with Menger's theorem.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.