Chromatic Number of Complete Graphs | Graph Theory

[@bytecode5834]

Thanks for the gift Sean

[@SHASHANKRUSTAGII]

The VIZING GUPTA Th. suggests that except for Kn and C2n+1, for all other graphs, chromatic number

[@abhishekghosh1998]

If possible, please can you make lectures on edge coloring as well? Moreover, it shall be of great help, if you could make some lectures on the inequalities (or bounds) on chromatics numbers. I am fond of your lectures...

[@locallyringedspace3190]

Does this video cover anything other than X(Kn) = n? Immediately, if Kn < G, X(G) >= n. Coloring bipartite graphs would be cool. I've always liked problems that make you enumerate nonisomorphic graphs with a certain chromatic number.

[@WrathofMath]

Thanks for watching and no - this lesson just goes over the first bit you mentioned, that the chromatic number of Kn is n. I’ve got more coloring lessons in the works, Bipartite graphs and more coming soon!

[@monoman4083]

good, clear explanation.

[@sree0801]

if the cycle graph is with n vertices and n is even then it needs 2 colors and if n is odd then it needs 3 colors. if the graph is bipartite then 2 colors are needed if the graph is a path graph then 2 colors are needed

[@لُطف-ب9خ]

Hello, how many chromatic number of (c7) power 2 ????

[@Vr_rohan0013]

Sir, please make a video on Chromatic Polynomial

[@davidshi451]

What about the edge-chromatic number of complete graphs?

[@WrathofMath]

Great question! I'll definitely make a video on that, and perhaps I'll come back tomorrow to offer a cursory explanation (far too tired to give one now).

[@tesfalegntadesse3123]

thanks sir

[@WrathofMath]

Thanks for watching!

[@PunmasterSTP]

Chromatic number? More like "Cool videos, none of which is a bummer!" 👍