Viewers like you help make PBS (Thank you 😃) . Support your local PBS Member Station here: At one time, Wolverine served on four different superhero teams. How did he do it? He may have used graph coloring. Tweet at us! @pbsinfinite Facebook: 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. Correction: At 3:58, "Four is the maximum number of required colors" Previous Episode - What is a Random Walk? Links to other resources: Sudoku: General Applications: Page on graph colorings: ~joe/Coloring/ Book on general graph theory: The Four Color Theorem - Numberphile: Written and Hosted by Kelsey Houston-Edwards Produced by Rusty Ward Graphics by Ray Lux Made by Kornhaber Brown ( ) Comments answered by Kelsey: Ofir David Bertie Blue ​TehAvenger29