Every planar graph can be colored with 4 colors max Ok, that's a theorem. As it says in this question.
I just cannot understand how mathematics can prove such a thing; what does exactly this theorem say? How to prove it mathematically?
Thanks!
 A: The first proof was due to Appel and Haken in 1977. However, as pointed out by Willie Wong, it is not really readable. Very roughly, it first uses a classification of almost 1500 "unavoidable configurations" of the triangulation of a plane. Next, using computers, it is shown that every of these configuration "leads" to a 4-coloration.
Appel and Haken published an algorithmic approach to this problem in K. Appel and W. Haken, Every Planar Map is Four-Colorable, American Mathematical Society 1989.
In 1997, another proof was published but still use the computer in a similar way. This was due to N. Robertson, D. Sanders, P.D. Seymour and R. Thomas.
To answer to your question How can math prove such a thing?, we see that computer plays a fundamental role in this particuliar problem. In fact, computer science plays a very fundamental part in today's research in finite structures. For instance, the Classification of the Finite Simple Groups is another very famous example. Computers were needed in several parts of the proof as they still are.
Now it does not reduce these results to "uninteresting" simply because computers are needed to prove them. To the contrary, the efforts needed for the conception and the implementation of such algorithms is in itself a very remarkable work.
In conclusion, mathematics can prove such things through algorithmic approaches and clever implementations in computers.
As a final remark, note also the following result due to Grötzsch, 1959:
Every planar graph not containing a triangle is 3-colorable.
