Definitions from Wiktionary (Menger's theorem)
▸ noun: (graph theory) 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.
▸ Words similar to Menger's theorem
▸ Usage examples for Menger's theorem
▸ Idioms related to Menger's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near Menger's theorem
▸ Rhymes of Menger's theorem
▸ Invented words related to Menger's theorem
▸ noun: (graph theory) 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.
Phrases:
▸ Words similar to Menger's theorem
▸ Usage examples for Menger's theorem
▸ Idioms related to Menger's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near Menger's theorem
▸ Rhymes of Menger's theorem
▸ Invented words related to Menger's theorem