# Unsolved Mathematics Problem Since 1990 Has Been Solved!

Two Danish computer scientists have solved the unsolvable math problem since 1990. The subject of this abstract problem is about graph theory. The point that cannot be solved is the inability to find an algorithm to solve the flatness of a dynamic graph. This may sound a bit scary. If you have insufficient knowledge of graph theories, we can think in a more fun way. When we went back to 1913, there were 3 utility problems for math riddles. Let’s put it simply. Draw 3 houses on a piece of paper, and there are 3 public utilities, electricity, water and natural gas under these houses. Now we have to connect these public services to every home, but the challenge here is; none of the lines should cross each other.

Can we do that? Unfortunately, it is not possible, all of these houses cannot get the connections before they meet, at least on a 2D paper. But this is not a problem to be solved anyway. Just an example of how graphical networks are not planar. Graphs also have corners and intersections just like these houses.

When dealing with more complex graphs with more vertices, mathematicians would use Kuratowski’s theorem to determine if graphs were planar, and they had been trying to develop algorithms to do the same faster since the 1970s. After all, some progress was made in this regard in the 1990s. It was one of the most important developments in recent years, at least for solving dynamic graphics. When we looked last year, computer scientists Jacop Holm from the University of Copenhagen and Eva Rotenberg from Denmark Technical University were working on this issue.