[Discrete Mathematics] Graph Coloring and Chromatic Polynomials
Vložit
- čas přidán 2. 06. 2015
- We talk about graph coloring and hwo to construct chromatic polynomials.
Visit our website: bit.ly/1zBPlvm
Subscribe on CZcams: bit.ly/1vWiRxW
-Playlists-
Discrete Mathematics 1: • Discrete Math (Sets, L...
Discrete Mathematics 2: • Discrete Math (Countin...
-Recommended Textbooks-
Discrete and Combinatorial Mathematics (Grimaldi): amzn.to/2T0iC53
Discrete Mathematics (Johnsonbaugh): amzn.to/2Hh7H41
Discrete Mathematics and Its Applications (Rosen): amzn.to/3lUgrMI
Book of Proof (Hammack): amzn.to/35eEbVgLike us on Facebook: on. 1vWwDRc
Submit your questions on Reddit: bit.ly/1GwZZrP
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.
![[Discrete Mathematics] Trees](http://i.ytimg.com/vi/zEQZpTizgLo/mqdefault.jpg)
![[Discrete Mathematics] Trees](/img/tr.png)
Best explanation I've seen! Thank YOU!
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...?
I have an exam today, appreciate it!
Best explanation about COLORING.
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
Hi i have learned so much things from you. thank you so much.from Iran
really helpful! thanks a ton! :)
very nicely explained!!thanx a ton!
"gonna put black cuz you can see that so well" lololol
Thats's rude and racist
.
.
.
.
jk sry
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!!!!
Thank you! It helped me a lot :)
thank you very much for this perfect explanation
thank you for this video.. it just helped me a lot :P
Im here cuz tomorrow i have an exam . Im so sick with education and thank you
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?
At 1:17, shouldn't {a, b} be in the edge set, not the vertex set?
Thank you very much.
Am very grateful.
God Bless you
Great video :)
well explained sir straight to the concept thanku :)
XD
thankuh so mch :) i understood so well ;)
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
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
Permutation factorials?
Yes. Exactly the same.
the videos are very helpfull..!!!
Thanx.. Great video. :-)
yo da real MVP mate :)
Have a quizz tomorrow about this and I'm not able to access the course materials you saved me
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.
I think I started to understand it, K graph, we can't use a color on and off. We can use a color on and off only for paths. For K Graph, if a color is used, that can't be used again ever. I hope I am right.
Very nice demonstration
Amitrajit Bose Target found!😂
Swapnil Sarkar Haaahhhahhaa😂😂😂 Haa bhai. Internal er jonno 😷😪
Amitrajit Bose Same here xD xD
Thank you!
Thank you u saved me
quality study material
Thank you man! from Syria and Sweden. I am a big fan of yous.
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.
thanks, what program do you use?
Windows Journal
Thanks:)
Thank you.
Thanks 👍
Thank you sir
When you use K, you mean a "complete" graph, am I right?
c should be lamdaa - 2 cant be same as d. Is that right??
I was also confused but after thinking for a while, lambda is actually not a color its the number of colors used so when we reach c we are not using a new color that is the reason why the value doesnt change
thanks a ton brother
Anytime man
to the point
This uses greedy algorithm and it doesn't always give the right answer.
The way you process the vertices also matter.
I just had an end semester exam and the answer was 3 but you can get 4 as an answer as well if you process the vertices in a different way.
Start with different vertices , different time.
you did not show the actual procedure to obtain a chromatic polynomial for ANY graph. DUH..
If handwritings were people this ones a hipster