A tree t is a graph thats both connected and acyclic. Graph theory is a field of mathematics about graphs. However, this simple concept took over one hundred years and involved more than a dozen mathematicians to finally prove it. The four color problem is examined in graph theory, where the vertex set is the regions of a map and an edge connects two vertices exactly. You cannot say whether the graph is planar based on this coloring the converse of the four color theorem is not true. This elegant little book discusses a famous problem that helped to define the field now known as graph theory. Graph theory simple english wikipedia, the free encyclopedia. Part i covers basic graph theory, eulers polyhedral formula, and the first published false proof of the four colour theorem. Appel and haken published an article in scienti c american in 1977 which showed that the answer to the problem is yes.
How the map problem was solved by robin wilson e ian stewart. It is not the easiest book around, but it runs deep and has a nice unifying theme of studying how. We present a new proof of the famous four colour theorem using algebraic and topological methods. The four colour conjecture was first stated just over 150 years ago, and. Finally i bought two books about the four color theorem. One can never rule out the chance that a short proof of the fourcolor theorem might. Graph theory, branch of mathematics concerned with networks of points connected by lines. The fourcolor theorem stands at the intersection of science and art. In this way, the controversy over the modern methods used in the proof of the fourcolor theorem had also spread to disciplines outside of mathematics. Four, five, and six color theorems nature of mathematics.
Posts, which date back to january, 2011, have included four color theorem. The title is a reference to the four basic colors used when printing comic books cyan, magenta, yellow and black at the time. The intuitive statement of the four color theorem, i. 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. We refer the ambitious student to conways book mathematical connections where i got the above proof of the 6 color theorem. The purpose of this question is to collect generalizations, variations, and strengthenings of the four color theorem with a description of their status. For every internally 6connected triangulation t, some good configuration appears in t. Pdf the four color theorem download full pdf book download. This book is written in california, thus in american english. The four color problem dates back to 1852 when francis guthrie, while.
Thus, the formal proof of the four color theorem can be given in the following section. This elegant little book discusses a famous problem that help. I, as a trained algebraic topologist, was asked to comment on this. 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. This is usually done by constructing the dualgraphof the map, and then appealing to the compactness theorem of propositional. A simpler statement of the theorem uses graph theory. In this paper, we introduce graph theory, and discuss the four color theorem. Kempe chains and the four colour problem, in studies in graph theory, part ii ed. The four color theorem asserts that every planar graph can be properly colored by four colors. Thus any map can be properly colored with 4 or fewer colors. For over one hundred and twenty years some of the best mathematical brains in the world were unsuccessful in. Both these proofs are computerassisted and quite intimidating.
Graphs, colourings and the fourcolour theorem by robert a. In mid1942, the numbering started over again, and series 2 began. A graph is a set of vertices, where a pair of vertices are connected with an edge if some relation holds between the two. The mathematical reasoning used to solve the theorem lead to many practical applications in mathematics, graph theory, and computer science. All you have to do is limit yourself to the type of graph used in this theorem. The proof theorem 1the four color theorem every planar graph is fourcolorable. Naturally, i was acquainted with the fourcolor 1 a latin word meaning the whole of something, a collective entirety. He covers basic graph theory, eulers polyhedral formula and the first. Anytime graph coloring is applicable, the four color theorem has an opportunity to shine. Part i covers basic graph theory, eulers polyhedral formula, and the first published false proof of the fourcolour theorem.
This problem was first posed in the nineteenth century, and it was quickly conjectured that in all cases four colors suffice. The adventurous reader is encouraged to find a book on graph theory for suggestions on how to prove the theorem. The four color theorem is true for maps on a plane or a sphere. It is important because it was first stated in 1852, but was not proved until 1976. For a more detailed and technical history, the standard reference book is. If a graph ghas no subgraphs that are cycle graphs, we call gacyclic. Until recently, it was regarded as a branch of combinatorics and was best known by the famous fourcolor theorem stating that any map can be colored using only four colors such that no two bordering countries have the same color.
Then we prove several theorems, including eulers formula and the five color theorem. The fourcolour theorem, that every loopless planar graph admits a vertexcolouring with at most four different colours, was proved in 1976 by appel and haken, using a computer. Each point is usually called a vertex more than one are called vertices, and the lines are called edges. Basic concepts of probability theory, random variables, multiple random variables, vector random variables, sums of random variables and longterm averages, random processes, analysis and processing of random signals, markov chains, introduction to queueing theory and elements of a queueing system. In graph theoretic terms, the theorem states that for loopless planar, the chromatic number of its dual graph is. Their magnum opus, every planar map is fourcolorable, a book claiming a.
The four coloring theorem every planar map is four colorable, seems like a pretty basic and easily provable statement. In graph theoretic terminology, the fourcolor theorem states that the vertices of every planar. In other words, only maps with all faces with five or more edges can be considered when searching for a demonstration of the problem. Buy graphs, colourings and the fourcolour theorem oxford science. The very best popular, easy to read book on the four colour theorem is. There are two proofs given by appel,haken 1976 and robertson,sanders,seymour,thomas 1997. The book is designed to be selfcontained, and develops all the graphtheoretical tools. 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. Graph theory is one of the fastest growing branches of mathematics. In graphtheoretic terminology, the fourcolor theorem states that the vertices of every planar graph can be colored with at most four colors so that no two adjacent vertices have the same color, or for short, every planar graph is fourcolorable thomas 1998, p.
Diestel is excellent and has a free version available online. Graphs on surfaces johns hopkins university press books. If t is a minimal counterexample to the four color theorem, then no good configuration appears in t. This is another important book which led to the research into problem solving and.
Part ii ranges widely through related topics, including mapcolouring on surfaces with holes, the famous theorems of kuratowski, vizing, and brooks, the conjectures of hadwiger and hajos, and much more besides. The subject of graph theory had its beginnings in recreational math problems see number game, but it has grown into a significant area of mathematical research, with applications in chemistry, operations research, social sciences, and computer science. Four color theorem simple english wikipedia, the free. Ive chosen the following introduction, but there are others that can be found here. Here we give another proof, still using a computer, but simpler than appel and hakens in several respects. The four color problem is discussed using terms in graph theory, the study graphs. The fact that three colors are not sufficient for coloring any map plan was quickly found see fig. All regular maps can be simplified by removing all faces with less than five edges, without affecting the search and the validity of the proof. This excellent book predates the four color theorems proof. In this degree project i cover the history of the four color theorem, from the origin, to the first proof by appel and haken in.
The number of colors needed to properly color any map is now the number of colors needed to color any planar graph. They are used to find answers to a number of problems. In graphtheoretic terminology, the fourcolor theorem states that the vertices of every planar. 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 fourcolour theorem, that every loopless planar graph admits a vertexcolouring with at most four different. Generalizations of the fourcolor theorem mathoverflow. Robert wilson robert wilson discusses the fourcolour theorem and some of the mathematics which developed out of attempts to solve it. From the above two theorems it follows that no minimal counterexample exists, and so the 4ct is true. One aspect of the fourcolor theorem, which was seldom covered and relevant to the field. History, topological foundations, and idea of proof by rudolf fritsch and gerda fritsch. On a university level, this topic is taken by senior students majoring in mathematics or computer science. Although flawed, kempes original purported proof of the four color theorem provided some of the basic tools later used to prove it. If \g\ is a planar graph, then the chromatic number of \g\ is less than or equal to 4.
The book is designed to be selfcontained, and develops all the graphtheoretical 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. The four colour theorem nrich millennium mathematics project. Graphs, colourings, and the fourcolour theorem book. In mathematics, the four color theorem, or the four color map theorem, states that, given any. Graphs, colourings and the fourcolour theorem oxford science.
Math common question a selection of answers to questions about the fourcolor map theorem, such as explanations, proofs, and extensions to higher dimensions and to the mobius. The fourcolor theorem states that any map in a plane can be colored using. Mathematically, the book considers problems on the boundary of geometry, combinatorics, and number theory, involving graph coloring problems such as the four color theorem, and generalizations of coloring in ramsey theory where the use of a toosmall number of colors leads to monochromatic structures larger than a single graph edge. Four color theorem 4ct states that every planar graph is four colorable. Ever since i launched the math section, i came to the realization that a lot of thrilling stories can be found in the area of graph theory.
746 723 300 812 82 918 761 154 307 315 729 1135 1429 438 1269 1289 1093 92 1324 978 1447 973 556 1087 1045 823 457 1119 560 611 1217 1581 1246 263 69 839 1143 688 794 355 311 1167 1126