Тёмный

[Discrete Mathematics] Graph Coloring and Chromatic Polynomials 

TrevTutor
Подписаться 278 тыс.
Просмотров 161 тыс.
50% 1

We talk about graph coloring and hwo to construct chromatic polynomials.
Visit our website: bit.ly/1zBPlvm
Subscribe on RU-vid: 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/35eEbV... 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.

Опубликовано:

 

29 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 56   
@prashannakumar570
@prashannakumar570 8 лет назад
"gonna put black cuz you can see that so well" lololol
@aliawied2713
@aliawied2713 6 лет назад
Thats's rude and racist . . . . jk sry
@arijitbagchi2197
@arijitbagchi2197 8 лет назад
very nicely explained!!thanx a ton!
@deepakvkashyap
@deepakvkashyap 8 лет назад
really helpful! thanks a ton! :)
@chimesilas
@chimesilas 7 лет назад
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
@visakh_vijayakumar_
@visakh_vijayakumar_ 7 лет назад
Thanx.. Great video. :-)
@DiptakBanerjee
@DiptakBanerjee 7 лет назад
you did not show the actual procedure to obtain a chromatic polynomial for ANY graph. DUH..
@Blum962
@Blum962 8 лет назад
Best explanation I've seen! Thank YOU!
@S_o_ev
@S_o_ev 9 месяцев назад
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.
@HamsaShehadeh
@HamsaShehadeh 3 года назад
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?
@thelastcipher9135
@thelastcipher9135 7 лет назад
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...?
@nattaphumjampalee206
@nattaphumjampalee206 4 года назад
Im here cuz tomorrow i have an exam . Im so sick with education and thank you
@NeelSandellISAWESOME
@NeelSandellISAWESOME 2 года назад
At 1:17, shouldn't {a, b} be in the edge set, not the vertex set?
@TrailokyanathSingh
@TrailokyanathSingh 5 месяцев назад
to the point
@federicoagostinelli9149
@federicoagostinelli9149 Год назад
When you use K, you mean a "complete" graph, am I right?
@natarajanb1714
@natarajanb1714 8 лет назад
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
@wardotard
@wardotard 4 года назад
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!!!!
@iamlazyboy98
@iamlazyboy98 3 года назад
Have a quizz tomorrow about this and I'm not able to access the course materials you saved me
@timelygoose
@timelygoose 10 месяцев назад
Thank you sir
@sweetygupta7552
@sweetygupta7552 7 лет назад
well explained sir straight to the concept thanku :)
@vivekn993
@vivekn993 4 года назад
XD
@sperera5916
@sperera5916 8 лет назад
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.
@sperera5916
@sperera5916 8 лет назад
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.
@coxixx
@coxixx 7 лет назад
Hi i have learned so much things from you. thank you so much.from Iran
@chimesilas
@chimesilas 7 лет назад
Thank you very much. Am very grateful. God Bless you
@paulaje9918
@paulaje9918 2 года назад
thank you very much for this perfect explanation
@arnabsaha8066
@arnabsaha8066 4 года назад
the videos are very helpfull..!!!
@sperera5916
@sperera5916 8 лет назад
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
@sperera5916
@sperera5916 8 лет назад
Permutation factorials?
@Trevtutor
@Trevtutor 8 лет назад
Yes. Exactly the same.
@abhinavs03
@abhinavs03 5 лет назад
yo da real MVP mate :)
@ashishnegi3848
@ashishnegi3848 6 лет назад
Best explanation about COLORING.
@justanaverageguy4739
@justanaverageguy4739 3 года назад
Thank you u saved me
@futureacid1997
@futureacid1997 9 лет назад
thank you for this video.. it just helped me a lot :P
@nvsabhishek7356
@nvsabhishek7356 3 года назад
Thank you.
@karishmazsweblog5561
@karishmazsweblog5561 8 лет назад
thankuh so mch :) i understood so well ;)
@khmielnitzkythomas8846
@khmielnitzkythomas8846 4 года назад
Thank you!
@siddhantsingh4870
@siddhantsingh4870 5 лет назад
Thanks 👍
@avhnfq
@avhnfq 5 лет назад
I have an exam today, appreciate it!
@sourav5562
@sourav5562 8 лет назад
Great video :)
@heilyx
@heilyx 5 лет назад
Thank you! It helped me a lot :)
@rohiljain2838
@rohiljain2838 8 лет назад
c should be lamdaa - 2 cant be same as d. Is that right??
@FaraazThePhenom
@FaraazThePhenom 8 лет назад
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
@rohiljain2838
@rohiljain2838 8 лет назад
thanks a ton brother
@FaraazThePhenom
@FaraazThePhenom 8 лет назад
Anytime man
@santi5655
@santi5655 7 лет назад
thanks, what program do you use?
@Trevtutor
@Trevtutor 7 лет назад
Windows Journal
@santi5655
@santi5655 7 лет назад
Thanks:)
@improbir
@improbir 7 лет назад
quality study material
@amitrajitbose6854
@amitrajitbose6854 6 лет назад
Very nice demonstration
@SwapnilSarkar
@SwapnilSarkar 6 лет назад
Amitrajit Bose Target found!😂
@amitrajitbose6854
@amitrajitbose6854 6 лет назад
Swapnil Sarkar Haaahhhahhaa😂😂😂 Haa bhai. Internal er jonno 😷😪
@SwapnilSarkar
@SwapnilSarkar 6 лет назад
Amitrajit Bose Same here xD xD
@debusinha9015
@debusinha9015 4 года назад
If handwritings were people this ones a hipster
@spicy_wizard
@spicy_wizard 5 лет назад
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.
@zolo8887
@zolo8887 6 лет назад
Thank you man! from Syria and Sweden. I am a big fan of yous.
Далее
[Discrete Mathematics] Trees
9:48
Просмотров 208 тыс.
[Discrete Mathematics] Planar Graphs
21:03
Просмотров 112 тыс.
▼ КАПИТАН НАШЁЛ НЕФТЬ В 🍑
33:40
Просмотров 310 тыс.
Офицер, я всё объясню
01:00
Просмотров 3,9 млн
The Boundary of Computation
12:59
Просмотров 1 млн
Chromatic Polynomial Examples
19:33
Просмотров 14 тыс.
Discrete Math II - 10.8.1 Graph Coloring
14:33
Просмотров 9 тыс.
INTRODUCTION to GRAPH THEORY - DISCRETE MATHEMATICS
33:23