Graph Theory 7: Five Color Theorem

preview_player
Показать описание
An introduction to the four color map theorem and proof of the five color theorem.
Рекомендации по теме
Комментарии
Автор

This is the most excellent explanation of this theorem I have ever seen. Very well done!

commandotaco
Автор

That's it? I always thought the proof of the 5CC was more complicated. Thank you for setting me straight.

cafeinst
Автор

Your teaching is colorful and detailed. Thank you so much for making it easier to understand.

minchuncho
Автор

This was amazing! Thank you for making this so easy to understand.

abhijithsreeraj
Автор

why cant all the countries come together, regardless of their color? :-(

christopherwalsh
Автор

How do know that when you swap colors in the connected chain you aren't undoing a prior coloring?

aislinnsmith
Автор

Thank you so much. What a clear, beautifully presented explanation.

syremusic_
Автор

This was extremely lovely as well as lively.

aastharanibansal
Автор

I'm a lil confused still—how can we assume that the chains will always contain two colours (orange and blue, or yellow and pink for eg)? Mightn't things be different if the chains had more colours? Also, why does the cycle of blue and orange vertices (left side) act as a barrier to yellow-pink chain? Couldn't (say) a pink vertex connect to (say) a blue dot as well?

juheehong
Автор

Thanks 4 ur lecture video plz. Clarify if we have only one chain and except the middle vertex and the chained vertices all have degree 1 then still we can not hv any free color to color the middle one

Bharatsingh-fvxf
Автор

Beautifully explained... Amazing Thank u so much ❤

dr.anjusunildahiya
Автор

little complicated idea. but got it at last

zaidazmy
Автор

The board!!!! please do not put it that way, it is way difficult to understand. It is way better if the board is behind you

ruthikarose
Автор

its booring because need for clear concept

GauravKumar-nplt