## 2/16/2020 -- Intermediate 1A: Some more graph theoryPlease use the worksheet from last week. This week we completed the rest of the Graph Theory packet, going over topics such as the coloring of a graph, which is the least number of colors required to fully "color" a graph. An interesting theory associated with this is that if one considers ANY map that separates the area into counties, states, cities, etc. then one can color that map with four colors such that no two adjacent counties, states, cities, etc. have the same color. This theorem was proved using computers! ## Handouts: |
||