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!!!!
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 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.
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.
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
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
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
![[Discrete Mathematics] Trees](http://i.ytimg.com/vi/zEQZpTizgLo/mqdefault.jpg)
![[Discrete Mathematics] Trees](/img/tr.png)
Best explanation I've seen! Thank YOU!
I have an exam today, appreciate it!
Im here cuz tomorrow i have an exam . Im so sick with education and thank you
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!!!!
Best explanation about COLORING.
"gonna put black cuz you can see that so well" lololol
Thats's rude and racist
.
.
.
.
jk sry
At 1:17, shouldn't {a, b} be in the edge set, not the vertex set?
Hi i have learned so much things from you. thank you so much.from Iran
to the point
Have a quizz tomorrow about this and I'm not able to access the course materials you saved me
well explained sir straight to the concept thanku :)
XD
thank you very much for this perfect explanation
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?
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...?
Thank you u saved me
Thank you sir
very nicely explained!!thanx a ton!
Thank you man! from Syria and Sweden. I am a big fan of yous.
Very nice demonstration
Amitrajit Bose Target found!😂
Swapnil Sarkar Haaahhhahhaa😂😂😂 Haa bhai. Internal er jonno 😷😪
Amitrajit Bose Same here xD xD
Thank you very much.
Am very grateful.
God Bless you
really helpful! thanks a ton! :)
When you use K, you mean a "complete" graph, am I right?
the videos are very helpfull..!!!
Thank you.
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.
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.
quality study material
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
Thank you! It helped me a lot :)
Thank you!
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
thank you for this video.. it just helped me a lot :P
Great video :)
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.
Thanks 👍
yo da real MVP mate :)
thankuh so mch :) i understood so well ;)
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
Thanx.. Great video. :-)
thanks, what program do you use?
Windows Journal
Thanks:)
you did not show the actual procedure to obtain a chromatic polynomial for ANY graph. DUH..
If handwritings were people this ones a hipster