Four Colors Suffice : : How the Map Problem Was Solved - Revised Color Edition / / Robin Wilson.

On October 23, 1852, Professor Augustus De Morgan wrote a letter to a colleague, unaware that he was launching one of the most famous mathematical conundrums in history--one that would confound thousands of puzzlers for more than a century. This is the amazing story of how the "map problem"...

Full description

Saved in:
Bibliographic Details
VerfasserIn:
MitwirkendeR:
TeilnehmendeR:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2021]
©2014
Year of Publication:2021
Language:English
Series:Princeton Science Library ; 128
Online Access:
Physical Description:1 online resource (224 p.) :; 87 color illus. 18 halftones. 60 line illus. 2 maps.
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 04915nam a22006855i 4500
001 9780691237565
003 DE-B1597
005 20211027022714.0
006 m|||||o||d||||||||
007 cr || ||||||||
008 211027t20212014nju fo d z eng d
020 |a 9780691237565 
024 7 |a 10.1515/9780691237565  |2 doi 
035 |a (DE-B1597)602089 
040 |a DE-B1597  |b eng  |c DE-B1597  |e rda 
041 0 |a eng 
044 |a nju  |c US-NJ 
050 4 |a QA612.19  |b .W56 2014eb 
072 7 |a MAT015000  |2 bisacsh 
082 0 4 |a 511/.56  |2 23 
100 1 |a Wilson, Robin,   |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Four Colors Suffice :  |b How the Map Problem Was Solved - Revised Color Edition /  |c Robin Wilson. 
264 1 |a Princeton, NJ :   |b Princeton University Press,   |c [2021] 
264 4 |c ©2014 
300 |a 1 online resource (224 p.) :  |b 87 color illus. 18 halftones. 60 line illus. 2 maps. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 0 |a Princeton Science Library ;  |v 128 
505 0 0 |t Frontmatter --   |t Contents --   |t Foreword --   |t Preface to the Revised Color Edition --   |t Preface to the Original Edition --   |t 1 The Four-Color Problem --   |t 2 The Problem Is Posed --   |t 3 Euler's Famous Formula --   |t 4 Cayley Revives the Problem . . . --   |t 5 . . . and Kempe Solves It --   |t 6 A Chapter of Accidents --   |t 7 A Bombshell from Durham --   |t 8 Crossing the Atlantic --   |t 9 A New Dawn Breaks --   |t 10 Success --   |t 11 Is It a Proof --   |t Chronology of Events --   |t Notes and References --   |t Glossary --   |t Picture Credits --   |t Index 
506 0 |a restricted access  |u http://purl.org/coar/access_right/c_16ec  |f online access with authorization  |2 star 
520 |a On October 23, 1852, Professor Augustus De Morgan wrote a letter to a colleague, unaware that he was launching one of the most famous mathematical conundrums in history--one that would confound thousands of puzzlers for more than a century. This is the amazing story of how the "map problem" was solved. The problem posed in the letter came from a former student: What is the least possible number of colors needed to fill in any map (real or invented) so that neighboring counties are always colored differently? This deceptively simple question was of minimal interest to cartographers, who saw little need to limit how many colors they used. But the problem set off a frenzy among professional mathematicians and amateur problem solvers, among them Lewis Carroll, an astronomer, a botanist, an obsessive golfer, the Bishop of London, a man who set his watch only once a year, a California traffic cop, and a bridegroom who spent his honeymoon coloring maps. In their pursuit of the solution, mathematicians painted maps on doughnuts and horseshoes and played with patterned soccer balls and the great rhombicuboctahedron. It would be more than one hundred years (and countless colored maps) later before the result was finally established. Even then, difficult questions remained, and the intricate solution--which involved no fewer than 1,200 hours of computer time--was greeted with as much dismay as enthusiasm. Providing a clear and elegant explanation of the problem and the proof, Robin Wilson tells how a seemingly innocuous question baffled great minds and stimulated exciting mathematics with far-flung applications. This is the entertaining story of those who failed to prove, and those who ultimately did prove, that four colors do indeed suffice to color any map. This new edition features many color illustrations. It also includes a new foreword by Ian Stewart on the importance of the map problem and how it was solved. 
538 |a Mode of access: Internet via World Wide Web. 
546 |a In English. 
588 0 |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 27. Okt 2021) 
650 0 |a Four-color problem  |x History. 
650 0 |a Four-color problem. 
650 0 |a Mathematical recreations  |x History. 
650 0 |a Proof theory  |x History. 
650 7 |a MATHEMATICS / History & Philosophy.  |2 bisacsh 
700 1 |a Stewart, Ian,   |e contributor.  |4 ctb  |4 https://id.loc.gov/vocabulary/relators/ctb 
700 1 |a Stewart, Ian. 
856 4 0 |u https://doi.org/10.1515/9780691237565?locatt=mode:legacy 
856 4 0 |u https://www.degruyter.com/isbn/9780691237565 
856 4 2 |3 Cover  |u https://www.degruyter.com/document/cover/isbn/9780691237565/original 
912 |a EBA_BACKALL 
912 |a EBA_CL_MTPY 
912 |a EBA_EBACKALL 
912 |a EBA_EBKALL 
912 |a EBA_ECL_MTPY 
912 |a EBA_EEBKALL 
912 |a EBA_ESTMALL 
912 |a EBA_PPALL 
912 |a EBA_STMALL 
912 |a GBV-deGruyter-alles 
912 |a PDA12STME 
912 |a PDA13ENGE 
912 |a PDA18STMEE 
912 |a PDA5EBK