Graph Theory 12: Cayley's Tree Theorem

How many labeled trees are there with n vertices? Introduces Cayley's tree theorem and Prufer codes.

[scorp]

It's amazing that you learned mirror writing just like DaVinci only so we could see everything clearly. Keep up the good work!

[erisaround]

This deserves more views. It's like the best math explanation video, i've ever seen.

[christopherwalsh]

your videos are 100% more helpful than our assigned online textbook.

[jasonzhang]

thanks for sharing. this is very helpful to understand cayley formula. I have been looking around online posts, and this video is the most clear and simplest answer.

[Johxzu]

Thank you for this! There was only 1 line about Cayley’s theorem in my teacher’s notes, you explained it beautifully

[XeridahNoelle]

How come the answer is 16 Labeles and not 12? They aren't the same shape... Do we just count them the same because of the amount of vertexe's they have is both 4?

[titicaca-fxcs]

It is so clearly explained. Is there a full course series on graph theory available?

[pushkarbansal]

this was awesome, i ussually dont comment on videos but u were great

[lordpeng]

muy bueno, es justo lo que estaba buscando gracias

[amedeozappulla]

how is possible that with n-2 number in a sequence get n to the power of (n-2), with (n-2) position and with n as the highest value you can have (n-2) to the power of n that is totally different.

[amine]

Good result, but missing the bijection proof

[mohammadyahya]

Fantastic explanation, wish if there are slides to download.

[akshaynagpal]

amazing explanation !! keep up the good work!

[irshadsirslectures]

I think caleys theorem is applicable to complete graph

[wardreidon]

how does (a1, a2, ...an-2) have n choices each ??

[omjoglekar]

what are you writing on ?
I wish to buy it and how much did it cost for you ?

[aleenageorge]

Thankyou sir...so amazing explanation .