This book is a clear and entertaining account of the long history of the attempts to provr four colour theorem that any map on can be coloured with at most four colour, such that no countries with a common border have the same colour. The four colour conjecture was first stated just over 150 years ago, and finally proved conclusively in 1976. The book discusses various attempts to solve this problem, and some of the mathematics which developed out of these attempts. Having fun with the 4color theorem scientific american. A path from a vertex v to a vertex w is a sequence of edges e1. Mar 01, 20 the 4color theorem is fairly famous in mathematics for a couple of reasons.
The title is a reference to the four basic colors used when printing comic books cyan, magenta, yellow and black at the time. The first statement of the four colour theorem appeared in 1852 but surprisingly it wasnt until 1976 that it was proved with the aid of a computer. The four colour theorem became a conjecture once again. Birkhoff, whose work allowed franklin to prove in 1922 that the four color conjecture is true for maps with at most twentyfive regions. The four color theorem was proved in 1976 by kenneth appel and wolfgang haken after many false proofs and counterexamples unlike the five color theorem, a theorem that states that five colors are enough to color a map, which was proved in the 1800s. Ive chosen the following introduction, but there are others that can be found here. It gives us a problem thats supposed to be impossible, but nobody is absolutely sure. They are called adjacent next to each other if they share a segment of the border, not just a point. His ideas, particularly the unavoidable set of configurations and consideration of their reducibility, became standard techniques for those who would follow. A simpler computeraided proof was published in 1997 and in 2005, the theorem was proven by mathematician georges gonthier with general purpose theorem proving software.
The four colour theorem was finally proved in 1976 by kenneth appel and wolfgang haken. The four color theorem history topological foundations and. Kenneth appel remembered for four color theorem proof. Two regions that have a common border must not get the same color.
Puzzlesfour colour map wikibooks, open books for an. Also, as the theorem states, two areas need to share a common border, just a common interception is not enough. Their magnum opus, every planar map is fourcolorable, a book claiming a complete and detailed proof with a microfiche supplement of over 400. And it can be adapted to a proof for the four colour theorem that was believed to be correct for ten years and then it was shown to be faulty. Oct 26, 2009 the four colour theorem became a conjecture once again. This method was the basis of kempes incorrect proof of the 4 colour theorem, and was used by heawood to prove the 5 colour theorem using five colours we are ok so long as there is always a region we can remove which borders at most five others, but that is true for any plane map. He asked his brother frederick if any map can be colored using four colors so that di. Challenge yourself to colour in the pictures so that none of the colours touch. For the first time a computer played a major role in proving a major mathematical theorem. In a complete graph, all pairs are connected by an edge. If t is a minimal counterexample to the four color theorem, then no good configuration appears in t.
The four color map theorem mentions that you only need four colors to color all the regions of any map without the intersection or touching of the same color as itself. It provided a lot of interesting information and was a great read. Graphs, colourings and the fourcolour theorem by robert a. Four color theorem in terms of edge 3coloring, stated here as theorem 3. The fourcolour theorem is one of the famous problems of mathematics, that frustrated generations of mathematicians from its birth in 1852 to its. Kempes proof for the four color theorem follows below. This investigation will lead to one of the most famous theorems of mathematics and some very interesting results. Each region must be contiguous that is it may not be partitioned as are. Ultimately, one has to have faith in the correctness of the compiler and hardware executing the program used for the proof. The four colour theorem mactutor history of mathematics. From the above two theorems it follows that no minimal counterexample exists, and so the 4ct is true. The four color theorem is a theorem in mathematics that states that given any map you need at most 4 different colors to color each patch of the map so that it is guaranteed that no patches next to each other have the same color. In this paper, we introduce graph theory, and discuss the four color theorem.
As an example, a torus can be colored with at most seven colors. This is usually done by constructing the dualgraphof the map, and then appealing to the compactness theorem of propositional. Nov, 2015 the first statement of the four colour theorem appeared in 1852 but surprisingly it wasnt until 1976 that it was proved with the aid of a computer. The 4color theorem is fairly famous in mathematics for a couple of reasons. A graph is a set of points called vertices which are connected in pairs by rays called edges. Coloring the four color theorem this activity is about coloring, but dont think its just kids stuff. Famous theorems of mathematicsfour color theorem wikibooks. History, topological foundations, and idea of proof softcover reprint of the original 1st ed. Graph theory, fourcolor theorem, coloring problems. They will learn the fourcolor theorem and how it relates to map coloring.
What is the minimum number of colors required to print a map so. The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state, the regions may be colored using no more than five colors in such a way that no two adjacent regions receive the same color. Pdf the four color theorem download full pdf book download. The four colour theorem nrich millennium mathematics project. History the four color theorem was proven in 1976 by kenneth appel and wolfgang haken. The four color theorem 4ct essentially says that the vertices of a planar graph may be colored with no more than four different colors. The very best popular, easy to read book on the four colour theorem is. It says that in any plane surface with regions in it people think of them as maps, the regions can be colored with no more than four colors.
The fourcolour theorem is one of the famous problems of mathematics, that frustrated. The four color map theorem or colour was a longstanding problem until it was cracked in 1976 using a new method. Feb 18, 20 the four color map theorem numberphile duration. Fourcolor theorem in terms of edge 3coloring, stated here as theorem 3. The four color theorem, or the four color map theorem, states that given any separation of the plane into contiguous regions, called a map, the regions can be colored using at most four colors so that no two adjacent regions have the same color. Reliable information about the coronavirus covid19 is available from the world health organization current situation, international travel. The appelhaken proof began as a proof by contradiction. The fourcolor theorem states that any map in a plane can be colored using fourcolors in such a way that regions sharing a common boundary other than a single point do not share the same color. It was the first major theorem to be proved using a computer. May 2003 four colours suffice the four colour theorem the statement that four colours suffice to fill in any map so that neighbouring countries are always coloured differently has had a long and controversial history.
The most epic book of maths ever explains how the fourcolour map theorem works. Thats why 2 colors would be enough for the following graph, the 2 red and the 2 blue areas dont count as each others neighbors. 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. Four, five, and six color theorems in 1852, francis guthrie pictured above, a british mathematician and botanist was looking at maps of the counties in england and discovered that he could always color these maps such that no adjacent country is the same color with at most four colors. There are many introduction useful to understand this problem, some of them more formal then others, but all can contribute to give an idea about the problem of coloring maps. The same method was used by other mathematicians to make progress on the fourcolor.
Pdf the journey of the four colour theorem through time. Birkhoff, whose work allowed franklin to prove in 1922 that the fourcolor conjecture is true for maps with at most twentyfive regions. It is an outstanding example of how old ideas can be combined with new discoveries. In 1890, percy john heawood created what is called heawood conjecture today. The new theorem was proved, or rather proved, because, in harnessing modern computing power as an essential ingredient in its demonstration, the methodology of the proof is still considered contentious in some quarters. At cayleys suggestion kempe submitted the theorem to the american journal of mathematics where it was published in. Appel and hakens approach started by showing that there is a particular set of 1,936 maps, each of which cannot be part of a smallestsized counterexample to the four color theorem.
To dispel any remaining doubts about the appelhaken proof, a simpler proof using the same. The four color theorem is a theorem of mathematics. At first, the new york times refused to report on the appelhaken proof. This was the first time that a computer was used to aid in the proof of a major theorem. It was first conjectured 150 years ago, and finally and infamously proved in 1976 with much of the work done by a computer. For the topological graph theory, see four color theorem. This method was the basis of kempes incorrect proof of the 4colour theorem, and was used by heawood to prove the 5colour theorem using five colours we are ok so long as there is always a region we can remove which borders at most five others, but that is true for any plane map. Please note that the content of this book primarily consists of articles available from wikipedia or other free sources online. The fourcolor theorem history, topological foundations, and. Two regions are called adjacent if they share a border segment, not just a point. The four color theorem was finally proven in 1976 by kenneth appel and wolfgang haken, with some assistance from john a. It dates back to 1852 when francis guthrie, while trying to color the map of counties of england, noticed that four colors su. This book discusses a famous problem that helped to define the field now known as topology. Four color theorem simple english wikipedia, the free.
Transum, friday, november, 2015 the four colour theorem states that it will take no more than four different colours to colour a map or similar diagram so that no two regions sharing a border are coloured in the same colour. Jun 29, 2014 the four color theorem was finally proven in 1976 by kenneth appel and wolfgang haken, with some assistance from john a. The four color theorem originated from a simple idea, coloring maps, and turned into a major mathematical controversy after the theorem was proved in 1976 by kenneth appel and wolfgang haken 1. Some background and examples, then a chance for them to have a go at. An investigation for pupils about the classic four colour theorem. We present a new proof of the famous four colour theorem using algebraic and topological methods. Jul 03, 2017 an investigation for pupils about the classic four colour theorem. As seen on the old maps of britain on the right, we can see that district all britain are coloured with red, yellow, green and blue. It asks the same question as the four color theorem, but for any topological object.
Find all the books, read about the author, and more. The four color theorem has been notorious for attracting a large number of false proofs and disproofs in its long history. The four colour conjecture rapidly became one of the most celebrated problems in mathematics. In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. The fourcolour theorem, that every loopless planar graph admits a vertex colouring with at most four different colours, was proved in 1976 by appel and haken.
Numerous and frequentlyupdated resource results are available from this search. Four, five, and six color theorems nature of mathematics. Kenneth appel 193220 together with wolfgang haken, proved the four color theorem and broke new ground in using a computer to complete the proof. Puzzlesfour colour map wikibooks, open books for an open world. The four colour theorem is a game of competitive colouring in.
Then we prove several theorems, including eulers formula and the five color theorem. This elegant little book discusses a famous problem that helped to define the field now known as graph theory. History, topological foundations, and idea of proof. Neuware in mathematics, the four color theorem, or the four color map theorem, states that given any separation of a plane into contiguous regions, called a map, the regions can be colored using at most four colors so that no two adjacent regions have the same color. Download pdf thefourcolortheorem free online new books. Four color theorem, acyclic coloring, list coloring, chromatic polynomial, equitable coloring, hadwiger conjecture, greedy coloring, erd. Students will gain practice in graph theory problems and writing algorithms. We assume that there exists a minimal graph that is not four colorable, thus every smaller graph can be four colored, for coloring graphs we will use the colors. The same method was used by other mathematicians to make progress on the four color. This problem is sometimes also called guthries problem after f. The four color theorem states that any plane separated into regions, such as a political map of the counties of a state, can be colored using no more than four colors in such a way that no two adjacent regions receive the same color. Oclcs webjunction has pulled together information and resources to assist library staff as they consider how to handle coronavirus. Mar 23, 2020 the four colour conjecture rapidly became one of the most celebrated problems in mathematics. This proof was first announced by the canadian mathematical society in 2000 and subsequently published by orient longman and universities press of india in 2008.
The four color theorem requires the map to be on a flat surface, what mathematicians call a plane. Four color theorem wikimili, the best wikipedia reader. In graphtheoretic terms, the theorem states that for loopless planar, the chromatic number of its dual graph is. Four color, also known as four color comics and one shots, was an american comic book anthology series published by dell comics between 1939 and 1962. Buy the four colour theorem on free shipping on qualified orders the four colour theorem. Coinciding with the publication of saaty and kainens book, the fourcolour map problem was finally solved. I used this book as a resource for my history of mathematics paper on the fourcolor theorem. The intuitive statement of the four color theorem, i.
Despite this flaw in his reasoning, kempe had actually done a lot of good mathematical work. This investigation will lead to one of the most famous theorems of. In mathematics, the four color theorem, or the four color map theorem, states that, given any. For every internally 6connected triangulation t, some good configuration appears in t. The four colour conjecture first seems to have been made by francis guthrie. Arthur cayley frs and the fourcolour map problem notes.
332 1141 1337 1300 1018 1156 1358 353 47 624 290 270 795 628 391 633 82 675 396 1290 929 756 1173 21 817 1162 1489 477 304 1052 704 1198 395 155 767 935