Proof: Closed Odd Walk contains Odd Cycle | Graph Theory

[@WrathofMath]

Feels good to be making graph theory content again! Continuing to grow the playlist, currently 156 videos strong. There is much left to cover! kzbin.info/aero/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH

[@plasmacrab_7473]

Very neat proof! I never learned about graph theory aside from the basics, but your explanation was very intuitive that (I think) I understand the entire proof. Thanks for the quality video! I'll definitely be watching more of your graph theory.

[@WrathofMath]

Thank you! Graph theory can be very intuitive, and is a wonderful field! My playlist on the topic has over 150 videos and there are many more planned.

[@praveenkumarp1581]

your channel is underrated. great work man

[@WrathofMath]

Thank you, Praveen!

[@ibnuahmedbare1201]

wooow. it 1:48am i am reviewing for my final exam and I found myself clapping when you finished the proof !!!!!!!!!!!!!! wow

[@huiwencheng4585]

The best proof for this lemma I have ever seen!!

[@WrathofMath]

Thank you!

[@uchatbhavya-fj3bm]

for even it is false ?

[@gordgodgord]

You should also be careful, it may be more than 2 v-v walks and since the *sum of some even numbers is even* and the length of W is odd then at least one of these v-v walks should be odd otherwise then l is even by the *(bold sentence) which is not.

[@KomalAdhikari-d4l]

can this leema holds for diagraph.??

[@PunmasterSTP]

The proof makes sense, but things still seem just a bit...odd.

[@vidapuamantej6376]

why not l = 1 as the base case.

[@akshattheintrovert3153]

To the best of my knowledge, since it is mentioned closed odd walk, it is not possible to make a closed odd walk of length 1 because closed means you have to reach the starting edge once you completed the graph.

[@babafunmiseadebowale7746]

@@akshattheintrovert3153 did you mean starting vertex? Also, isn't what he drew at 4:50 the odd walk of length 1?