Intro to Menger's Theorem | Graph Theory, Connectivity
Автор: Wrath of Math
Загружено: 2020-05-05
Просмотров: 30413
Support the production of this course by joining Wrath of Math to access all my graph theory videos!
/ @wrathofmath
🛍 Check out the coolest math clothes in the world: https://mathshion.com/
Graph Theory course: • Graph Theory
Graph Theory exercises: • Graph Theory Exercises
Get the textbook! https://amzn.to/3HvI535
Menger's theorem tells us that for any two nonadjacent vertices, u and v, in a graph G, the minimum number of vertices in a u-v separating set is equal to the maximum number of internally disjoint u-v paths in G. #graphtheory
The Proof of Menger's Theorem: • Proof: Menger's Theorem | Graph Theory, Co...
◆ Support Wrath of Math on Patreon: / wrathofmathlessons
Follow Wrath of Math on...
● Instagram: / wrathofmathedu
● Facebook: / wrathofmath
● Twitter: / wrathofmathedu
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
