What are Vertex Disjoint Paths? | Graph Theory
ฝัง
- เผยแพร่เมื่อ 6 มี.ค. 2020
- 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
Thank you so much for explaining it so clearly… My professor didn't explain it very well after a decade of teaching!!!
So glad it was helpful! Thanks for watching!
Vertex disjoint? More like "Very cool videos, that help you get the point!"
Thanks a lot for this! You're a great teacher.
You're very welcome and thank you! :)
Awesome explanation! Thanks!!
You're welcome and thank you! Glad it was clear!
Thanks for all of your videos, the ease of learning is greatly appreciated 🙌🏼
My pleasure, thanks for watching!
Wrath of Math is amazing! I have a question, can you prove by induction or by the application Menger theorem that the connectivity of n-cube has the connectivity of n. I have been trying to solve it by induction however I am not getting it. Maybe a Menger theorem application directly? Please a formal proof would be fantastic with your style of teaching!
please upload a video on Mader's thm also
Could you make a lesson on "Block-Cutvertex Tree"
Elxplain edge disjoint subgraph
P = (d,c,b) ; Q = (d,e,f), Are P and Q internally vertex disjoint path?
Thanks for watching and good question! I'm not sure precisely how I described internally disjoint paths in this video (since I made it a while ago), but I would say no, your example is not two internally disjoint paths. You could define internally disjoint paths to simply be paths that have no common internal vertices, in which case your paths would be internally disjoint paths, but so far as I can tell - this term is used only for paths connecting the same pair of vertices. So P and Q would not be internally disjoint because they don't end at the same vertex. Does that help?
Edit: As usual, you may have cause in your own research, or others may have cause in their research that I haven't seen, to define internally disjoint paths slightly differently. What I typically try to do is present what is most common/useful.
can i ask u physics concepts
What physics concepts did you have questions about?