As an example, a torus can be colored with at most seven colors. The outer ring of that galaxy, also made of countless stars, glistened with hazy blue light. Let v be a vertex in g that has the maximum degree. Discrete math for computer science students ken bogart dept. Then, we will prove eulers formula and apply it to prove the five color theorem. The parity pass is an algorithm designed to color a map that has been colored except for a. Here was a fullpage, colored picture of our neighboring galaxy, andromeda see page 12. L1 we may assume that p is greater than or equal to 7. For use in this proof, he invented an algorithm for graph coloring that is still relevant today, for use in many applications such as register allocation in compilers. The 6 color theorem nowitiseasytoprovethe6 colortheorem. Avertexcoloring of agraphisanassignmentofcolorstotheverticesofthegraph.
This is usually done by constructing the dualgraphof the map, and then appealing to the compactness theorem of propositional. In this post, i am writing on the proof of famous theorem known as five color theorem. 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. Platonic solids 7 acknowledgments 7 references 7 1. The postmark on university of illinois mail after the four color theorem. Francis guthrie 1852 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. Two regions that have a common border must not get the same color. Five color theorem 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.
In fact, this proof is extremely elaborate and only recently discovered and is known as the 4colour map theorem. It involves the investigation of minimal counterexamples sometimes referred to as minimal criminals. A computerchecked proof of the four colour theorem georges gonthier microsoft research cambridge this report gives an account of a successful formalization of the proof of the four colour theorem, which was fully checked by the coq v7. In section 5, we discuss an algorithm, the parity pass, discovered by spencerbrown. It asks the same question as the four color theorem, but for any topological object. In this paper we prove a coloring theorem for planar graphs. V by eulers theorem, we conclude that the average degree of a vertex is. I know how to prove that every planar graph is 6 and 5 colorable. Then we may ask what bound on these edge lengths ensures that g will be 5colorable. Graph theory and the fourcolor theorem week 4 ucsb 2015 through the rest of this class, were going to refer frequently to things called graphs. They are called adjacent next to each other if they share a segment of the border, not just a point. Abstractin this note, we show that the edges and faces of any plane graph with maximum degree three can be simultaneously colored with five colors. One of the more wellstudied problems related to coloring and graph planarity is the question of how many colors are required in order to color a map such that. He published this proof in the american journal of mathematics.
Now, assume inductively that all planar graphs with n 1 vertices can be colored in 5 colors thus if v is removed, we can color the graph properly in 5 colors. Lemma 2 every planar graph g contains a vertex v such that degv 5. Notice that there are at most five neighbors to this face and they have colors red, blue, green, yellow, orange. The key idea is to color g so that every vertex is adjacent to vertices with every other color. If plane g has three vertices or less, then g can be 3colored. Kempe also tried to prove it, but his proof failed. Many have heard of the famous four color theorem, which states that any map drawn on a plane can be colored with 4 colors. Applications of fourier analysis to nonanalytic fields turner smith. Now onto a famous formula this formula says that, if a.
We have already shown the proof for the 6 colour theorem for planar graphs, and now we will prove an even stronger result, the 5 colour theorem. A fivecolor theorem for graphs on surfaces 499 k handles, is taken to be some nice surface in r3 and that a graph g embedded on sk has all edges rectifiable in r3. Fivecoloring plane graphs mathematics stack exchange. 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. There are at most 4 colors that have been used on the neighbors of v. 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. Many simpler maps can be colored using three colors.
Five color theorem simple english wikipedia, the free. To dispel any remaining doubts about the appelhaken proof, a simpler proof using the same. If g is a planar graph, then by eulers theorem, g has a 5. Four, five, and six color theorems nature of mathematics. Nov 28, 2018 errera this graph can be used to show that the kempe chain proof of the five color theorem theorem 10. The fourth color is needed for some maps, such as one in which one region is surrounded by an odd number of others, which touch each other in a cycle. It states that any plane which is separated into regions, such as a map, can be colored with no more than five colors. One early example of this technique is kainens proof 6 of the 5 color theorem. May 11, 2018 5 color theorem proof using mathematical induction method graph theory lectures discrete mathematics graph theory video lectures in hindi for b. It was first stated by alfred kempe in 1890, and proved by percy john heawood eleven years. A donut shaped, reddish ring made of billions of faint stars surrounded the central core. In 1890, percy john heawood created what is called heawood conjecture today. Using a similar method to that for the formal proof of the five color theorem, a formal proof is proposed in this paper of the four color theorem, namely, every planar graph is fourcolorable.
Let g be the counterexample with minimum number vertices. The five color theorem states that five colors are enough to color a map. To prove that every planar graph can be colored with at most ve colors, we. Four color theorem simple english wikipedia, the free. Pdf we present a short topological proof of the 5color theorem using only the nonplanarity of k6. Suppose we define nice to mean that sk is a differentiable manifold 16, 23. Eulers formula and the five color theorem min jae song abstract. We will prove this five color theorem, but first we need some other results. I was wondering if proof by induction or contradiction is better, but i decided for proof by induction, as this is easier to translate in actual code then.
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. Hide help hover cursor over text of this color to see a popup reference for the symbol or name. Theorem 1 for any planar graph g, the chromatic number. By our inductive hypothesis, you can color this map with the one face removed with at most six colors. Four color theorem wikimili, the best wikipedia reader. Ive found a book and some pdf materials about this problem. 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. Right before my eyes, in full color, was the probable design of gods universewhite, red, and blue. Eulers formula and the five color theorem anagha sundararajan. Now, assume inductively that all planar graphs with n 1 vertices can be colored in 5 colors thus if v is removed, we can color the graph properly in 5 colors what if we add back v to the graph now 21. You use all the right ideas, but should be more exacty in the elaborations. The three and five color theorem proved here states that the vertices of g can be colored with five colors, and using at most three colors on the boundary of. Appel princeton university, 2016 these slides help explain color.
So g can be colored with five colors, a contradiction. A bad idea, we think, directed people to a rough road. Then we prove several theorems, including eulers formula and the five color theorem. The 5 color theorem vertexedgeface relation for planar graphs to prove that every planar graph can be colored with at most ve colors, we need to rst understand what is special about planar graphs, as if we drop the planar assumption, then there are many graphs that cannot be colored by ve or less colors, such ask 5, the complete graph of order 5. In 1879 alfred kempe 18491922, using techniques similar to those described above, started from the five neighbours property and developed a procedure known as the method of kempe chains to find a proof of the four colour theorem. Errera this graph can be used to show that the kempe chain proof of the five color theorem theorem 10. Expand and collapse sections of the argument using the, and other buttons. This proof is largely based on the mixed mathematicscomputer proof 26 of. Introduction many have heard of the famous four color theorem. Astronomer miller captured this beautiful picture showing the full andromeda galaxy, made up of three rings each of a different color. Jun 06, 2000 a five color theorem a five color theorem sanders, daniel p zhao, yue 20000606 00. In 1890, heawood brought the rst serious ideas to this problem, and proved that planar graphs could be 5 colored along the way, he found a aw in kempes 11 year old widely accepted \proof of the 4 color conjecture. Eulers formula and the five color theorem contents 1. Contents introduction preliminaries for map coloring.
In 1879, alfred kempe gave a proof that was widely known, but was incorrect, though it was not until 1890 that this was noticed by percy heawood, who modified the proof to show that five colors suffice to color any planar graph. The four color theorem is a theorem of mathematics. Any map can be colored with six or fewer colors in such a way that no adjacent territories receive the same color. When finding the number of ways that an event a or an event b can occur, you add instead. Manifold gis has long had a fivecolor algorithm built in. An online game to find planar embeddings for planar graphs.
Heawood did use some of kempes ideas to prove the five color theorem. The formal proof proposed can also be regarded as an. The fact that three colors are not sufficient for coloring any map plan was quickly found see fig. It was first stated by alfred kempe in 1890, and proved by percy john heawood eleven years later. For example, you swithch from no path at all to exists a path. By previous lemma, we can pick x 2 v g with degree 5. Now you need to decide on how to color the removed face. The five color theorem is a result from graph theory that given a plane separated into regions. The way they prove it is by using induction when two vertices are precolored but there. This proof of the five color theorem is based on a failed attempt at the four color proof by alfred kempe in 1879. The five color theorem is a theorem from graph theory.
Connected components of vertices with two colors in a legal coloring can switch colors. The five color theorem is implied by the stronger four color theorem, but. The four color theorem requires the map to be on a flat surface, what mathematicians call a plane. Let g be the smallest planar graph in terms of number of vertices that cannot be colored with five colors. In this paper, we introduce graph theory, and discuss the four color theorem. Thomas, robin 1996, efficiently fourcoloring planar graphs pdf, proc. Find materials for this course in the pages linked along the left.
252 108 855 1516 430 414 1395 1198 822 522 1331 918 890 52 789 899 1447 512 66 87 528 1412 503 1479 589 581 1256 1465 472 396 147 177 180