What are Vertex Disjoint Paths? | Graph Theory

What are vertex disjoint paths in graph theory? Sometimes called pairwise vertex disjoint paths, they're exactly what you'd expect. We say two paths are vertex disjoint if they have no common vertices! We go over some examples, talk about internally disjoint paths, maximum numbers of internally disjoint paths, and Menger's theorem in today's video graph theory lesson!







I hope you find this video helpful, and be sure to ask any questions down in the comments!

+WRATH OF MATH+

◆ Support Wrath of Math on Patreon:   / wrathofmathlessons  

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu  

My Music Channel:    / seanemusic