Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00285791n
Noun Named Entity
AR
No term available
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
Relations
Sources
IS A
مبرهنة
NAMED AFTER
كارل مينغر

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