Edge Colorings and Chromatic Index of Graphs | Graph Theory

[@WrathofMath]

Support the production of this course by joining Wrath of Math as a Channel Member for exclusive and early videos, original music, and upcoming lecture notes for the graph theory series! Plus your comments will be highlighted for me so it is more likely I'll answer your questions!
ua-cam.com/channels/yEKvaxi8mt9FMc62MHcliw.htmljoin
Graph Theory course: ua-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Graph Theory exercises: ua-cam.com/play/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L.html

[@alejandrorz6577]

Just waiting for the Vizing's theorem video, the proof of that theorem its really neat.

[@visheshjindal9853]

++

[@PunmasterSTP]

I bet it's gonna be a real Vizinger!

[@0peter897]

Nice explanation, thank you! One note: Vizing's theorem can only be used to simple graphs. (I failed my midterm, because I forgot about this :c )

[@quezcatol]

was waiting for this, thanks!

[@WrathofMath]

My pleasure! Thanks for watching!

[@user-yf5xs2zf5l]

Thank you

[@WrathofMath]

You're welcome!

[@aashsyed1277]

Nice explanation! 👍

[@vonage_sasb9356]

Hello,
Do any one know answer for "Does there exist a 3-edge colourable graph with 10 vertices and 20 edges ?"

[@chaotischekreativitat9391]

Sounds like an exercise question 😂
Hint: Think about the degrees of those vertices that are possible under these circumstances.

[@ponnu1500]

Very useful video.. Thankyou

[@WrathofMath]

Glad to hear it, thanks for watching!

[@rajendragoudar2961]

Nenga suriya fan ah?

[@ponnu1500]

@@rajendragoudar2961 yes.. Surya fan

[@neutronology5524]

nice im using it in class rn

[@WrathofMath]

Thank you for watching, glad it helped!

[@PunmasterSTP]

That's cool. How'd the rest of your class go?

[@aashsyed1277]

Awesome 😎

[@janmarjagolina1235]

Is empty graph has 0 chromatic index?

[@tshwareloshabalala8394]

Hello. Yes I suppose, since there are no edges to color.

[@LearningCS-jp4cb]

trivial, empty and null graphs

[@dhe1782]

How to proof that the crossing number of K6 is 3. Thanks!!

[@PunmasterSTP]

Oh man, another edgy lecture...

[@vonage_sasb9356]

Hello,
Do any one know answer for "Does there exist a 3-edge colourable graph with 10 vertices and 20 edges ?"

[@umarmurtala5572]

From my little understanding, I don't think it exists, since an graph graph can't be 3 edge colorable

[@vonage_sasb9356]

@@umarmurtala5572 Yes you are correct