[Discrete Mathematics] Graph Coloring and Chromatic Polynomials

  Рет қаралды 160,360

TrevTutor

TrevTutor

Күн бұрын

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

Пікірлер: 56
@Blum962
@Blum962 8 жыл бұрын
Best explanation I've seen! Thank YOU!
@prashannakumar570
@prashannakumar570 8 жыл бұрын
"gonna put black cuz you can see that so well" lololol
@aliawied2713
@aliawied2713 6 жыл бұрын
Thats's rude and racist . . . . jk sry
@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!!!!
@NeelSandellISAWESOME
@NeelSandellISAWESOME 2 жыл бұрын
At 1:17, shouldn't {a, b} be in the edge set, not the vertex set?
@avhnfq
@avhnfq 5 жыл бұрын
I have an exam today, appreciate it!
@nattaphumjampalee206
@nattaphumjampalee206 4 жыл бұрын
Im here cuz tomorrow i have an exam . Im so sick with education and thank you
@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?
@ashishnegi3848
@ashishnegi3848 6 жыл бұрын
Best explanation about COLORING.
@coxixx
@coxixx 7 жыл бұрын
Hi i have learned so much things from you. thank you so much.from Iran
@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...?
@deepakvkashyap
@deepakvkashyap 8 жыл бұрын
really helpful! thanks a ton! :)
@paulaje9918
@paulaje9918 2 жыл бұрын
thank you very much for this perfect explanation
@arijitbagchi2197
@arijitbagchi2197 8 жыл бұрын
very nicely explained!!thanx a ton!
@sweetygupta7552
@sweetygupta7552 6 жыл бұрын
well explained sir straight to the concept thanku :)
@vivekn993
@vivekn993 4 жыл бұрын
XD
@zolo8887
@zolo8887 6 жыл бұрын
Thank you man! from Syria and Sweden. I am a big fan of yous.
@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
@chimesilas
@chimesilas 7 жыл бұрын
Thank you very much. Am very grateful. God Bless you
@iamlazyboy98
@iamlazyboy98 3 жыл бұрын
Have a quizz tomorrow about this and I'm not able to access the course materials you saved me
@justanaverageguy4739
@justanaverageguy4739 3 жыл бұрын
Thank you u saved me
@timelygoose
@timelygoose 10 ай бұрын
Thank you sir
@heilyx
@heilyx 5 жыл бұрын
Thank you! It helped me a lot :)
@user-hi4lc7co6x
@user-hi4lc7co6x 5 ай бұрын
to the point
@sperera5916
@sperera5916 7 жыл бұрын
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 7 жыл бұрын
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.
@arnabsaha8066
@arnabsaha8066 4 жыл бұрын
the videos are very helpfull..!!!
@federicoagostinelli9149
@federicoagostinelli9149 Жыл бұрын
When you use K, you mean a "complete" graph, am I right?
@futureacid1997
@futureacid1997 9 жыл бұрын
thank you for this video.. it just helped me a lot :P
@nvsabhishek7356
@nvsabhishek7356 3 жыл бұрын
Thank you.
@improbir
@improbir 7 жыл бұрын
quality study material
@khmielnitzkythomas8846
@khmielnitzkythomas8846 4 жыл бұрын
Thank you!
@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
@sourav5562
@sourav5562 7 жыл бұрын
Great video :)
@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
@sperera5916
@sperera5916 7 жыл бұрын
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 7 жыл бұрын
Permutation factorials?
@Trevtutor
@Trevtutor 7 жыл бұрын
Yes. Exactly the same.
@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.
@karishmazsweblog5561
@karishmazsweblog5561 8 жыл бұрын
thankuh so mch :) i understood so well ;)
@abhinavs03
@abhinavs03 5 жыл бұрын
yo da real MVP mate :)
@siddhantsingh4870
@siddhantsingh4870 5 жыл бұрын
Thanks 👍
@visakh_vijayakumar_
@visakh_vijayakumar_ 7 жыл бұрын
Thanx.. Great video. :-)
@S_O_EVERYTHING
@S_O_EVERYTHING 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.
@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
@DiptakBanerjee
@DiptakBanerjee 7 жыл бұрын
you did not show the actual procedure to obtain a chromatic polynomial for ANY graph. DUH..
@santi5655
@santi5655 7 жыл бұрын
thanks, what program do you use?
@Trevtutor
@Trevtutor 7 жыл бұрын
Windows Journal
@santi5655
@santi5655 7 жыл бұрын
Thanks:)
@debusinha9015
@debusinha9015 4 жыл бұрын
If handwritings were people this ones a hipster
[Discrete Mathematics] Trees
9:48
TrevTutor
Рет қаралды 208 М.
ISOMORPHISMS and BIPARTITE GRAPHS - DISCRETE MATHEMATICS
16:58
TrevTutor
Рет қаралды 202 М.
Running With Bigger And Bigger Feastables
00:17
MrBeast
Рет қаралды 213 МЛН
1ОШБ Да Вінчі навчання
00:14
AIRSOFT BALAN
Рет қаралды 6 МЛН
Modus males sekolah
00:14
fitrop
Рет қаралды 15 МЛН
Linear Applications:  Percent, Consecutive Integers, Work
14:56
Discrete Math II - 10.8.1 Graph Coloring
14:33
Kimberly Brehm
Рет қаралды 9 М.
The World's Best Mathematician (*) - Numberphile
10:57
Numberphile
Рет қаралды 7 МЛН
[Discrete Mathematics] Planar Graphs
21:03
TrevTutor
Рет қаралды 112 М.
How to Tell if Graph is Bipartite (by hand) | Graph Theory
8:55
Wrath of Math
Рет қаралды 61 М.
Researchers thought this was a bug (Borwein integrals)
17:26
3Blue1Brown
Рет қаралды 3,5 МЛН
[Discrete Mathematics] Euler's Theorem
18:36
TrevTutor
Рет қаралды 75 М.
Vertex Colorings and the Chromatic Number of Graphs | Graph Theory
13:23
Running With Bigger And Bigger Feastables
00:17
MrBeast
Рет қаралды 213 МЛН