Solving the Wolverine Problem with Graph Coloring | Infinite Series
3,755
by Super User, 8 years ago
Tweet at us! @pbsinfinite
Facebook: facebook.com/pbsinfinite series
Email us! pbsinfiniteseries [at] gmail [dot] com
Graph coloring may seem simple but the mathematics behind it is surprising difficult and it pops up in a number strange places. Kelsey discusses Sudoku, the Four Color Theorem, the Hadwiger Nelson Problem and how graph coloring can be used to schedule the most effective way to save the planet. Find out how math can defeat the combined might of Thanos, Magneto, Kang, Dormammu, Ultron, Apocalypse and Dr. Doom.
Previous Episode - What is a Random Walk?
https://www.youtube.com/watch?v=stgYW6M5o4k
Links to other resources:
Sudoku: http://www.ams.org/notices/200706/tx070600708p.pdf
General Applications: http://web.math.princeton.edu/math_alive/5/Notes2.pdf
Page on graph colorings: https://webdocs.cs.ualberta.ca/~joe/Coloring/index.html
Book on general graph theory: http://diestel-graph-theory.com/
The Four Color Theorem - Numberphile: https://www.youtube.com/watch?v=NgbK43jB4rQ
Written and Hosted by Kelsey Houston-Edwards
Produced by Rusty Ward
Graphics by Ray Lux
Made by Kornhaber Brown (www.kornhaberbrown.com)
Comments answered by Kelsey:
Ofir David
https://www.youtube.com/watch?v=stgYW6M5o4k&lc=z12vin2o2vn0dxvn522wsr5j0wexezd0j
Bertie Blue
https://www.youtube.com/watch?v=stgYW6M5o4k&lc=z22xhfxbgx3qsh2ujacdp4333fssxeq5w1z4avpprddw03c010c
TehAvenger29
https://www.youtube.com/watch?v=stgYW6M5o4k&lc=z12qtxqgqpyftrzmy22wyxl5gy3ssvcpf04
-
Super User uploaded a new media, Solving the Wolverine Problem with Graph Coloring | Infinite Series
8 years ago