Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00285791n
Noun Named Entity
Categories: Theorems in graph theory, Articles with permanently dead external links, Graph connectivity, Network theory
EN
Menger's theorem  Erdős-Menger conjecture  Erdős–Menger conjecture  Menger's n-arc theorem  Menger theorem
EN
In the mathematical discipline of graph theory and related areas, Menger's theorem is a characterization of the connectivity in finite undirected graphs in terms of the maximum number of disjoint paths that can be found between any pair of vertices. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical discipline of graph theory and related areas, Menger's theorem is a characterization of the connectivity in finite undirected graphs in terms of the maximum number of disjoint paths that can be found between any pair of vertices. Wikipedia
Theorem characterizing graph connectivity by disjoint paths Wikidata
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. Wiktionary
IS A
theorem
NAMED AFTER
Karl Menger
Wikipedia
EN
Menger's theorem
Wikidata
EN
Menger's theorem
Wiktionary
EN
Menger's theorem
Wikipedia Redirections
EN
Erdős-Menger conjecture, Erdős–Menger conjecture, Menger's n-arc theorem, Menger's Theorem, Menger theorem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License