Proof: Graph with n Vertices and n-1 Edges is a Tree | Graph Theory

[@WrathofMath]

Support the production of this course by joining Wrath of Math as a Channel Member for exclusive and early videos, original music, and upcoming lecture notes for the graph theory series! Plus your comments will be highlighted for me so it is more likely I'll answer your questions!
ua-cam.com/channels/yEKvaxi8mt9FMc62MHcliw.htmljoin
Graph Theory course: ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Graph Theory exercises: ua-cam.com/play/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L.html

[@mgames1710]

Very clean explanation, thank you so much!

[@WrathofMath]

My pleasure, thanks for watching! If you're looking for more graph theory, check out my playlist! ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html

[@Aman_iitbh]

can we say directly when we first time delete edge from cycle that the remaining graph is connected and deg is still n but edge is n-2 so its violating theorem that any connected graph of order n has size atleast n-1

[@LearningCS-jp4cb]

Are you studying in an IIT from India? If so, are you learning graph theory for college exam or something else?

[@richardhunter132]

so, if I have a graph, all I need to do is count the number of vertices and the number of edges, and as long as the number of edges is one less than the number of vertices, then I have a tree?

[@isaacwritescode]

What a legend🛐

[@WrathofMath]

I do my best - thank you for watching!

[@mishabalakirsky243]

Was really helpful, thanks a lot!

[@WrathofMath]

Glad it helped!

[@Fearnotsforlove]

This was a great and clear explanation! Thank you!

[@parthajyoti743]

Hey plz make video on Ramsey number

[@psinghcpr]

Can you make a video on mantel and turan's theorem. If yes then please prove it with zykov symmetrization.

[@WrathofMath]

Thanks for watching and for the requests! I will certainly do videos on Mantel's and Turan's theorem, I'll try to do them sooner than later. I am not familiar with Zykov Symmetrization, do you have any references you'd recommend on the topic?

[@psinghcpr]

@@WrathofMath Thanks . You can refer to david conlon ' s notes or yufei Zhao's notes on graph theory and additive combinatorics . The later has video lectures available on mit ocw youtube channel.
Hope you check them out.

[@no_money_funny]

good job man

[@WrathofMath]

Thank you!

[@foocaha3990]

how to prove that a graph with 5 vertices and 4 edges is not necessary to be a tree if it is connected?

[@foocaha3990]

if i use kite shape without cross line and use just one straight line in kite shape is it correct ?

[@itv5610]

That's not possible for a connected graph. That is what was proved in this video.

[@browse101]

IT IS a tree

[@alexandradepillis-lindheim7039]

This was awesome! thank you:)

[@WrathofMath]

So glad it was helpful, thanks for watching! Check out my graph theory playlist if you're looking for more, and let me know if you ever have any questions! ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html

[@rexfordboakye5312]

Sounds great

[@WrathofMath]

Thanks!

[@saketkumar4972]

great, the video could have been smaller tho

[@fio6143]

rap of math. love it tho. keep it up :)

[@WrathofMath]

Thank you - I will!

[@keithplays1184]

👍👍👍👍

[@WrathofMath]

Thanks for watching, Keith!

[@PunmasterSTP]

Ah, another edgy lecture!