Can you cross seven city bridges without repeating a path? Mathematics says no.
In short: In 18th-century Königsberg, residents puzzled over whether they could walk across all seven bridges spanning the local river exactly once. Leonhard Euler transformed this recreational riddle into a rigorous proof, inadvertently inventing the field of graph theory and changing how we understand the geometry of position forever.
The Königsberg bridge problem centered on a simple question: could a person traverse seven bridges connecting two islands and two mainland banks without crossing any bridge twice? In 1735, the Swiss mathematician Leonhard Euler provided a definitive answer, proving that no such path could exist. His approach was revolutionary because it ignored the physical geography of the city, focusing instead on the abstract connections between land masses.
Euler simplified the city into a network of vertices—representing land—and edges—representing bridges. He realized that for a path to traverse every edge exactly once, the number of edges connected to each vertex, known as its degree, must follow specific rules. Specifically, a path can only exist if there are at most two vertices with an odd number of edges. Because the Königsberg map featured four land masses with an odd number of bridges, a continuous traversal was mathematically impossible.
This work, which Euler called geometria situs, or the geometry of position, moved mathematics beyond the traditional Aristotelian focus on quantity and measurement. By demonstrating that the structure of the network was the only relevant factor, Euler laid the groundwork for both graph theory and topology. His 1735 presentation to the St. Petersburg Academy is now recognized as the first theorem in graph theory, a field that has since become essential to computer science, chemistry, and the study of complex networks.
The legacy of this puzzle extends into modern mathematics through the study of Eulerian circuits—paths that visit every edge exactly once and return to the start. While Eulerian graphs require all vertices to have an even degree, other problems, such as the Hamiltonian circuit, remain more complex to characterize. Euler’s initial insight remains a foundational example of how abstracting away physical detail can reveal the hidden structural truths of a system.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Königsberg bridge problem | Mathematics, Graph Theory & Network Theory | Britannica
- Also: Seven Bridges of Königsberg
To cite this card, link to https://intellectplus.co.uk/app/science-seven-bridges-of-k-nigsberg.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
Related
More in Discrete mathematics · More in Science · Latest · A–Z · All topics