Four-color theorem (one of the three major mathematical problems in the modern world), also known as four-color conjecture and four-color problem, is one of the three major mathematical conjectures in the world. The essence of the four-color theorem is the inherent property of a two-dimensional plane, that is, two straight lines in the plane that cannot intersect and have no common points. Many people have proved that it is impossible to construct five or more connected regions on the two-dimensional plane, but it does not rise to the level of logical relationship and two-dimensional inherent attributes, which leads to many wrong counterexamples.

But these are precisely the textual research and development promotion of the rigor of graph theory. The computer proves that although we have made tens of billions of judgments, we have only succeeded in a huge number of advantages, which does not conform to the strict logic system of mathematics, and there are still countless math enthusiasts involved.

Extended data:

The content of the four-color problem is "any map with only four colors can make countries with the same border have different colors." In other words, a map only needs four colors to mark it, which will not cause confusion.

Expressed in mathematical language, it means "divide the plane into non-overlapping areas at will, and each area can always be marked with one of the four numbers 1234, without making two adjacent areas get the same number." The contiguous zone mentioned here means that there is a whole section of boundary that is common. Two regions are not adjacent if they intersect at one point or a limited number of points. Because painting them the same color won't cause confusion.