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
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
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 "
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?
There are seven bridges so it is impossible to go through each bridge exactly once. That is proven because the degree of the graph must be even to contain an Euler Path or its sub-type a Euler Circuit.
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
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
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
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
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?
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.
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 explanation, great visualization. Thank you.
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
Great work sir
Great job Trefor!
Well explained👏👏
Thank you so much it was worth watching 😍
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.
Superb explanation
Great explanation :)
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
Really good video and well explained! Thanks!
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?
There are seven bridges so it is impossible to go through each bridge exactly once. That is proven because the degree of the graph must be even to contain an Euler Path or its sub-type a Euler Circuit.
great shit bro
Amazing💕😍
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
Thanks
❤❤❤
He pronounces Euler as oiler, I call it a YOU-ler
the mic is bad and too loud