Vizing's Theorem
ฝัง
- เผยแพร่เมื่อ 1 ส.ค. 2024
- A proof of Vizing's theorem about graph edge coloring.
------------------
Timetable:
0:00 - Intro
0:24 - Theorem
1:02 - Lower bound
1:12 - Free colors
1:42 - Upper bound
4:11 - Outro
------------------
Source code:
github.com/xiaoxiae/videos/tr...
Music:
ZigZag Heart by Blue Dot Sessions: app.sessions.blue/browse/trac...
Software used:
Manim (animations): github.com/ManimCommunity/manim/
Kdenlive (video): kdenlive.org/en/
ffmpeg (video): ffmpeg.org/
arecord (audio): linux.die.net/man/1/arecord
sox (audio): sox.sourceforge.net/
Social media:
Website (for other things I'm up to): slama.dev/
Patreon (if you'd like to support me): / ytoms
------------------
[CZ] Martin Koutecký's lecture on Combinatorics and Graph Theory:
research.koutecky.name/db/tea...
You lost me 2:42
Everything before that point was nicely illustrated. Then, in the above time, most of the information was said instead of shown.
You're right, I should bave added more animations since what I'm saying is not obvious. I'll try to make sure that there aren't any places like this in my future videos.
Great video. Does much better job (to explain the algorithm / proof) than any 30 min / one hour video on Vizing's theorem. Some details are kinda "left to check for the student" but the proof is all there.
I was about to comment about the audio and pacing, but realized it was recommended after having watched your latest video. Congrats on the progress! It's a lot better
Good job. Nice and proper presentation of Vizing's theorem.
That's a great video, appreciate the time format.
Great video!
Not many people here make graph theory videos so this is a change.
Your initial valid coloring example isnt valid or is it?