This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs.
"synopsis" may belong to another edition of this title.
This elegant little book discusses a famous problem that helped to define the field now known as graph theory: what is the minimum number of colors required to print a map such that no two adjoining countries have the same color, no matter how convoluted their boundaries are. Many famous mathematicians have worked on the problem, but the proof eluded formulation until the 1970s, when it was finally cracked with a brute-force approach using a computer. The Four-Color Theorem begins by discussing the history of the problem up to the new approach given in the 1990s (by Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas). The book then goes into the mathematics, with a detailed discussion of how to convert the originally topological problem into a combinatorial one that is both elementary enough that anyone with a basic knowledge of geometry can follow it and also rigorous enough that a mathematician can read it with satisfaction. The authors discuss the mathematics and point to the philosophical debate that ensued when the proof was announced: just what is a mathematical proof, if it takes a computer to provide one - and is such a thing a proof at all?
Fritsch of the University of Munich, Germany
Fritsch of the University of Munich, Germany
Fritsch of the University of Munich, Germany
"About this title" may belong to another edition of this title.
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand. Seller Inventory # ZMHU8NPPTQ
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 20179953
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # 6666-IUK-9781461272540
Quantity: 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 20179953-n
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs. 280 pp. Englisch. Seller Inventory # 9781461272540
Quantity: 2 available
Seller: Books Puddle, Woodside, NY, U.S.A.
Condition: New. pp. 280. Seller Inventory # 2697512116
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 280 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 95966571
Quantity: 4 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 276 pages. 8.43x5.85x0.73 inches. In Stock. Seller Inventory # x-1461272548
Quantity: 2 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, . Seller Inventory # 4189881
Quantity: Over 20 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 280. Seller Inventory # 1897512126
Quantity: 4 available