Yesterday I was a bit bored, and then I recalled having read the biography of a German mathematician called Heinrich Heesch several years ago, who spent most of his life on solving the so-called four-colour problem. ( http://en.wikipedia.org/wiki/Four_color_theorem ) The four-colour problem is about the question whether four colours are always enough to colourize a two-dimensional map in such a way that there are no adjacent countries having the same colour. I pondered over this problem and after some time I came to the conclusion that the problem is trivial: Every two-dimensional map can be represented by a planar graph that has no crossings. (I called it a "two-dimensional graph".) In such a graph, it is possible to draw up to 4 nodes which have edges leading to each other, but it is not possible to draw more than 4 - otherwise, there would be a crossing. Therefore, four colours always suffice. The "official" proofs of this problem, which is now called a theor
Es werden Posts vom Juni, 2010 angezeigt.