Home / Series / Discrete Mathematics / Aired Order / Season 1 / Episode 22

Coloring Graphs and Maps

According to the four-color theorem, any map can be colored in such a way that no adjacent regions are assigned the same color and, at most, four colors suffice. Learn how this problem went unsolved for centuries and has only been proved recently with computer assistance.

English
  • Runtime 30 minutes
  • Created November 3, 2010 by
    Administrator admin
  • Modified November 3, 2010 by
    Administrator admin