Numerical calculations on the four-color problem

Abstract

It is shown in this paper that a map not colorable in four colors must have at least n=40 countries. This improves on the result n=36 due to C. E. Winn (1940). The rather elaborate computations are based upon the Euler contributions of the faces in an irreducible graph and upon several new reducible configurations.