Day 129 · May 8

Leonhard Euler and the Seven Bridges of Königsberg

The city of Königsberg once sat around a river divided into islands connected by seven bridges. The puzzle sounded simple enough for an afternoon walk: Could someone cross every bridge exactly once without repeating any? People tried repeatedly. Again and again they failed. The problem eventually reached Leonhard Euler. Euler approached the puzzle differently from everyone else. He ignored almost everything physical about the city. The exact distance between bridges did not matter. The architecture did not matter. The shape of the river did not matter. Only the connections mattered. This shift changed mathematics forever. Euler reduced the entire city into dots and lines. Land became points. Bridges became links. Suddenly the problem transformed from geography into structure. Euler discovered something profound: For such a walk to exist, the number of land regions connected by an odd number of bridges must be either zero or two. Königsberg had four. The walk was impossible. What made Euler's solution revolutionary was not merely the answer. It was the abstraction. Mathematics had learned to study relationships independently of physical appearance. This idea eventually gave birth to graph theory and topology, fields that now shape enormous parts of modern civilization. Computer networks. Transportation systems. Social media connections. Airline routes. Internet infrastructure. All rely heavily on mathematical structures descended from Euler's insight. And there is something beautiful about the origin of it all. One of the most important revolutions in mathematics began not with astronomy or war or engineering. It began with people wondering how to take a walk across a city without crossing the same bridge twice.

Under what condition does an Eulerian path exist in a graph? A path exists if and only if exactly zero or two vertices have an odd degree.

Practice related topics on DuelMath

Challenge someone →