Graph Theory 12: Cayley's Tree Theorem

[@scorp6684]

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

[@mikeCavalle]

lol

[@noltron000]

Doesn't he just mirror the video recording itself? That makes it a lot easier...

[@scorp6684]

@@noltron000 Wouldn't it just be a mirror image then? That doesn't hold up bro.

[@noltron000]

​@@mikeCavalle I'd agree with you, if you could prove to me that this man is left-handed.

[@drumeophile]

​@@scorp6684 He is writing straight, but camera sees mirror image, but he mirrors the video again, double mirror makes the videos straight.

[@erisaround]

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

[@christopherwalsh3101]

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

[@nashful7167]

Fr I read the textbook for an hour then this 10 minute video cleared it all up

[@jasonzhang6534]

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

[@titicaca-fx9cs]

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

[@MathatAndrews]

Yes, this is part 12 in the series. You can watch them all by selecting the playlist on our channel homepage.

[@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?

[@pushkarbansal4663]

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

[@MathatAndrews]

Thanks! Glad you're enjoying the series!

[@lordpeng4778]

muy bueno, es justo lo que estaba buscando gracias

[@amedeozappulla6600]

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.

[@amine2684]

Good result, but missing the bijection proof

[@mohammadyahya78]

Fantastic explanation, wish if there are slides to download.

[@wardreidon]

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

[@amedeozappulla6600]

i think that he made a mistake

[@akshaynagpal22]

amazing explanation !! keep up the good work!

[@omjoglekar3677]

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

[@MathatAndrews]

It's a lightboard! We built this one ourselves, but there are plenty of places online where you can purchase one or learn how to build one.

[@kcelej]

​@@MathatAndrews wait, so are you writing all this stuff mirrored?

[@irshadsirslectures4446]

I think caleys theorem is applicable to complete graph

[@roblox_is_cringe351]

no, its only applicable to trees.

[@KrishnaMahajan1207]

Great man Thanks

[@aleenageorge8189]

Thankyou sir...so amazing explanation .

[@indian8586]

understood the concept

[@gena8414]

proof?

[@mikeCavalle]

lovely lecture.