UWEC CERCA 2025

This problem is suited for individual and/or group work. Together we will explore the color theorem by having you explore a map of the United States and try coloring each state with different colors. In doing so in such a way where there are no two states touching each other that are the same color. What is the least number of colors in which this is possible to do? This presentation will include presenting the problem, providing work and discussion time, as well as a detailed solution and explanation of why the color theorem works.