Advertisement

On reducibility in the four color problem

  • Hassler Whitney
Part of the Contemporary Mathematicians book series (CM)

Abstract

Quite recently, Y. Shimamoto showed (Report, AMD 618, Brookhaven National Laboratory) that the four color map theorem would be proved if a certain configuration H of H. Heesch were proved “D-reducible.” A computer program has been run (considering nearly 200,000 different colorings of the boundary C of H, each one a complicated problem); the computer said “yes.” I am told that the computer was asked the wrong question.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 1992

Authors and Affiliations

  • Hassler Whitney

There are no affiliations available

Personalised recommendations