Is the Four Colour Theorem?

The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not share the same color. This problem is sometimes also called Guthrie's problem after F.

Is the 4 Colour theorem proved?

Abstract: A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color theorem. ... The formal proof proposed can also be regarded as an algorithm to color a planar graph using four colors so that no two adjacent vertices receive the same color.

Why is the four color theorem significant?

In addition to its inviting simplicity, the Four Color Theorem is famous for its inflection point in the history of math: it was the very first major theorem “proved” through brute-forcing scenarios with a computer. In today's day-&-age that's a rather historically-significant breakthrough.