[Discrete Mathematics] Graph Coloring and Chromatic Polynomials

We talk about graph coloring and hwo to construct chromatic polynomials.

*--Playlists--*

*--Recommended Textbooks--*

We introduce graph coloring and look at chromatic polynomials.

Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.

[Blum]

Best explanation I've seen! Thank YOU!

[wardotard]

Only because the black shows so well, two thumbs up! Oh, one thumb up.
Truthfully, thanks for your videos and everything you have done for me the past year, you rock!!!!

[NeelSandellISAWESOME]

At 1:17, shouldn't {a, b} be in the edge set, not the vertex set?

[nattaphumjampalee]

Im here cuz tomorrow i have an exam . Im so sick with education and thank you

[HamsaShehadeh]

how about the point that dont connect to any other point? what should i color it? a different color that no point got it? or same as any point color?

[coxixx]

Hi i have learned so much things from you. thank you so much.from Iran

[thelastcipher]

when counting the chromatic number of a cycle like the one you did near the end of the video, would it make sense if we divide by the number of vertices since we can rotate the cycle n times, where n is the number of vertices, to avoid overcounting...?

[iamlazyboy]

Have a quizz tomorrow about this and I'm not able to access the course materials you saved me

[paulaje]

thank you very much for this perfect explanation

[sweetygupta]

well explained sir straight to the concept thanku :)

[chimesilas]

Thank you very much.
Am very grateful.
God Bless you

[prashannakumar]

"gonna put black cuz you can see that so well" lololol

[federicoagostinelli]

When you use K, you mean a "complete" graph, am I right?

[chimesilas]

Hello Trev, you mentioned everything except how to find the chromatic polynomial of an incomplete graph. eg. when 2 edges are missing from a k5 and you are required to find the chromatic polynomial of that graph, please tell me what to do or anyone can please respond.
Thanks

[sperera]

Trev, please explain this. For the path, it is L, L-1, L-1, L-1... but for the K graph, it is L, L-1, L-2, L-3. Why the difference, if we also say L-1, L-1.. this should be fine as L Lambda means number of colors.

[zolo]

Thank you man! from Syria and Sweden. I am a big fan of yous.

[sperera]

Hello Trev, at 5:48, the sequence is simplified as L!/(L-n)!. What did you derive that simplification? Can you direct me to an online article please. Thank you

[natarajanb]

x(k m, 1) problems chromatic number 2 is ok but coloring fist vertex1 pink color common vertex green vertex 2 again green. is it correct sir, bcz both common vertex and vertex2 posses same color and connected (adjacent one). plz reply

[futureacid]

thank you for this video.. it just helped me a lot :P

[spicy_wizard]

i am interested to know more of graph coloring problem. In Tsinghua University Discrete Math, they dive into this topic way deeper than the fancy intro you have done.