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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Birkhäuser Boston
About this chapter
Cite this chapter
Whitney, H. (1992). On reducibility in the four color problem. In: Eells, J., Toledo, D. (eds) Hassler Whitney Collected Papers. Contemporary Mathematicians. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-2972-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2972-8_12
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7740-8
Online ISBN: 978-1-4612-2972-8
eBook Packages: Springer Book Archive