Combinatorics and Graph Theory

Four Color Theorem-simplified

Authors: Richard L. Hudson
Comments: 5 Pages.

The conjecture [1] stated that four colors are sufficient for any 2-dimensional plane map so that no two regions with a shared border are the same color. The conjecture is now a theorem [2], the result of a lengthy and complex proof, involving over 1000 classifications of graph objects and over 1000 hours of computer time.
Category: Combinatorics and Graph Theory