Euler Paths & the 7 Bridges of Konigsberg | Graph Theory
Вставка
- Опубліковано 2 жов 2024
- An Euler Path walks through a graph, going from vertex to vertex, hitting each edge exactly once. But only some types of graphs have these Euler Paths, it depends on the degree of the vertices. We state and motivate the big theorem, and then use it to solve the infamous 7 bridges of Konigsberg problem that motivated Euler to start studying graph theory.
►FULL DISCRETE MATH PLAYLIST: • Discrete Math (Full Co...
OTHER COURSE PLAYLISTS:
►CALCULUS I: • Calculus I (Limits, De...
► CALCULUS II: • Calculus II (Integrati...
►MULTIVARIABLE CALCULUS (Calc III): • Calculus III: Multivar...
►VECTOR CALCULUS (Calc IV): • Calculus IV: Vector Ca...
►DIFFERENTIAL EQUATIONS: • How to solve ODEs with...
►LINEAR ALGEBRA: • Linear Algebra (Full C...
OTHER PLAYLISTS:
► Learning Math Series
• 5 Tips To Make Math Pr...
►Cool Math Series:
• Cool Math Series
BECOME A MEMBER:
►Join: / @drtrefor
MATH BOOKS & MERCH I LOVE:
► My Amazon Affiliate Shop: www.amazon.com...
SOCIALS:
►Twitter (math based): / treforbazett
►Instagram (photography based): / treforphotography
Thank you so much! Yours is the first video I found that actually breakdown the logic of in-out and why there has to be 2 odd vertices.
you're going great, the way you give explanation touches the every contents and brings easy to understand
Trefor: Pause the video and try it out and see
Me: Pauses videos and struggles to find path for 45 mins
Trefor: It is impossible!!
Love you guy! I feel like I owe you tuition fees or something
Great explanation, great visualization. Thank you.
Great job Trefor!
It's so interesting that there's an impossibility in human creation. I wonder if they ended up building another bridge to solve the problem.
Superb explanation
He pronounces Euler as oiler, I call it a YOU-ler
Great explanation :)
❤❤❤
What about If E= {(A,C),(A,B),(B,C),(C,B)} then the degree of A = 2, B = 3, c = 3 and you have a Euler path (C -> A -> B -> C -> B)?
I googled it and found "if a graph is connected and has exactly 2 odd vertices then it has an Eurlerian path "
Yeah,but the eulerian path should start from one of the odd vertex and end at the other,in that case.
Suppose I remove one edge connecting AB. Consider path CBDBAC. Isn't this an Euler circuit? Why doesn't this contradict the Theorem at 4:45?
Amazing💕😍
In the six-bridge problem as shown by the graph below, how many ways are there of traversing all six bridges (shown as edges here) exactly once?
Well explained👏👏
Thank you so much it was worth watching 😍
Can you share me the video link where you told this 5:20
i am curious to see the proof of the other direction of this statement
Great work sir
What if you took out two Edges from A to B and B to C, wouldn't some vertices be odd degree and and Euler path be possible? Or does that not count because you went to A twice? But you didn't use the edge twice?
I was also thinking on this
solve 👇⬇️
In seven bridges problem, was it possible for citizen of Konigsberg to make a tour of the city and cross each bridge exactly twice? Give reason
At 4:35 you say that if it even has 1 vertex with odd degree, then there is no Euler Circuit, but isn't that contrary to what you said before, that if it starts odd and the last vertex is also odd, but everything in the middle is even, then there is an Euler Circuit.
For example: Take ABCDE, A and E have 3 vertices, but BCD have two (A:B, A:C, A:D, B:E, C:E, D:E), you can have an Euler Circuit
Thanks
great shit bro
Really good video and well explained! Thanks!
I was really hoping this was a computer science channel because this concept was explained so well. Keep up the good work!
Once you get to the theory there is no difference. Math is simply a programming language who's syntax is free written
the mic is bad and too loud