Solving the Wolverine Problem with Graph Coloring | Infinite Series
by Super User, 3 weeks 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?
Links to other resources:
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:
Super User uploaded a new media, Solving the Wolverine Problem with Graph Coloring | Infinite Series
3 weeks ago.