A classical problem asking if it is possible to always color a map with just four colors and never have countries that border one another be colored the same. The question has been settled in the affirmative with computers. This is perhaps one of the more accessible combinatorics problems, as it can be delved into without any math at all.

back to combinatorics--

Log in or register to write something here or to contact authors.