The Four-Color Theorem

The Four-Color Theorem PDF

Author: Rudolf Fritsch

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 269

ISBN-13: 1461217202

DOWNLOAD EBOOK →

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.

The Four-Color Theorem and Basic Graph Theory

The Four-Color Theorem and Basic Graph Theory PDF

Author: Chris McMullen

Publisher:

Published: 2020-05-26

Total Pages: 426

ISBN-13: 9781941691090

DOWNLOAD EBOOK →

Explore a variety of fascinating concepts relating to the four-color theorem with an accessible introduction to related concepts from basic graph theory. From a clear explanation of Heawood's disproof of Kempe's argument to novel features like quadrilateral switching, this book by Chris McMullen, Ph.D., is packed with content. It even includes a novel handwaving argument explaining why the four-color theorem is true. What is the four-color theorem? Why is it common to work with graphs instead of maps? What are Kempe chains? What is the problem with Alfred Kempe's attempted proof? How does Euler's formula relate the numbers of faces, edges, and vertices? What are Kuratowski's theorem and Wagner's theorem? What is the motivation behind triangulation? What is quadrilateral switching? What is vertex splitting? What is the three-edges theorem? Is there an algorithm for four-coloring a map or graph? What is a Hamiltonian cycle? What is a separating triangle? How is the four-color theorem like an ill-conditioned logic puzzle? Why is the four-color theorem true? What makes the four-color theorem so difficult to prove by hand?

Graphs, Colourings and the Four-Colour Theorem

Graphs, Colourings and the Four-Colour Theorem PDF

Author: Robert A. Wilson

Publisher: OUP Oxford

Published: 2002-01-24

Total Pages: 153

ISBN-13: 019158360X

DOWNLOAD EBOOK →

The four-colour theorem is one of the famous problems of mathematics, that frustrated generations of mathematicians from its birth in 1852 to its solution (using substantial assistance from electronic computers) in 1976. The theorem asks whether four colours are sufficient to colour all conceivable maps, in such a way that countries with a common border are coloured with different colours. The book discusses various attempts to solve this problem, and some of the mathematics which developed out of these attempts. Much of this mathematics has developed a life of its own, and forms a fascinating part of the subject now known as graph theory. The book is designed to be self-contained, and develops all the graph-theoretical tools needed as it goes along. It includes all the elementary graph theory that should be included in an introduction to the subject, before concentrating on specific topics relevant to the four-colour problem. Part I covers basic graph theory, Euler's polyhedral formula, and the first published false `proof' of the four-colour theorem. Part II ranges widely through related topics, including map-colouring on surfaces with holes, the famous theorems of Kuratowski, Vizing, and Brooks, the conjectures of Hadwiger and Hajos, and much more besides. In Part III we return to the four-colour theorem, and study in detail the methods which finally cracked the problem.

Four Colors Suffice

Four Colors Suffice PDF

Author: Robin J. Wilson

Publisher: Princeton University Press

Published: 2002

Total Pages: 284

ISBN-13: 9780691120232

DOWNLOAD EBOOK →

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.

Every Planar Map is Four Colorable

Every Planar Map is Four Colorable PDF

Author: Kenneth I. Appel

Publisher: American Mathematical Soc.

Published: 1989

Total Pages: 760

ISBN-13: 0821851039

DOWNLOAD EBOOK →

In this volume, the authors present their 1972 proof of the celebrated Four Color Theorem in a detailed but self-contained exposition accessible to a general mathematical audience. An emended version of the authors' proof of the theorem, the book contains the full text of the supplements and checklists, which originally appeared on microfiche. The thiry-page introduction, intended for nonspecialists, provides some historical background of the theorem and details of the authors' proof. In addition, the authors have added an appendix which treats in much greater detail the argument for situations in which reducible configurations are immersed rather than embedded in triangulations. This result leads to a proof that four coloring can be accomplished in polynomial time.

Introduction to Graph Theory

Introduction to Graph Theory PDF

Author: Richard J. Trudeau

Publisher: Courier Corporation

Published: 2013-04-15

Total Pages: 224

ISBN-13: 0486318664

DOWNLOAD EBOOK →

Aimed at "the mathematically traumatized," this text offers nontechnical coverage of graph theory, with exercises. Discusses planar graphs, Euler's formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, more. 1976 edition.

Graph Coloring Problems

Graph Coloring Problems PDF

Author: Tommy R. Jensen

Publisher: John Wiley & Sons

Published: 2011-10-24

Total Pages: 320

ISBN-13: 1118030745

DOWNLOAD EBOOK →

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.

Pearls in Graph Theory

Pearls in Graph Theory PDF

Author: Nora Hartsfield

Publisher: Courier Corporation

Published: 2013-04-15

Total Pages: 272

ISBN-13: 0486315525

DOWNLOAD EBOOK →

Stimulating and accessible, this undergraduate-level text covers basic graph theory, colorings of graphs, circuits and cycles, labeling graphs, drawings of graphs, measurements of closeness to planarity, graphs on surfaces, and applications and algorithms. 1994 edition.