Research
Danish researchers find efficient solution to famous 174-year-old mathematical headache
Phys.org ·
The Brief
- The question of whether any map can be coloured with four colours dates back to 1852.
- Since 1976 it has been known that four colours are always sufficient, but the source says that finding the actual colouring was unclear.
- Two Danish professors reportedly found an efficient solution for producing such a colouring.
Why it matters
The result turns a known existence proof into a practical method for finding valid four-colour maps, which matters for mathematicians and for algorithms that depend on graph colouring.
Who’s affected
- mathematicians working in graph theory
- computer scientists who develop graph-colouring algorithms
- #graph theory
- #four colour theorem
- #map colouring
- #algorithms
- #mathematics
Can any map be colored using just four colors? That is the question behind one of the most famous problems of mathematics, dating back to 1852. Since 1976, we have known that the answer is "yes"—but how do you actually find the coloring? Now, two professors from the University of…