Seven Bridges of Königsberg: Euler’s Proof Explained
Quick answer: The seven bridges of Königsberg puzzle asks whether you can walk through the city crossing each of its seven bridges exactly once. In 1736, Leonhard Euler proved it is impossible. He ignored distances and shapes and kept only which land areas the bridges connect (today we draw this as dots and lines), and showed that such a walk is possible only if zero or two land areas have an odd number of bridges. In Königsberg, all four areas had an odd number, so no walk works. This idea founded graph theory.
In the 1700s, the Prussian city of Königsberg (now Kaliningrad, Russia) sat on both banks of the Pregel River and two islands, linked by seven bridges. Residents wondered whether they could take a walk that crossed every bridge exactly once. Nobody could find one. In 1736, Leonhard Euler proved that nobody ever would, and invented a new branch of mathematics in the process.
Euler’s Key Idea: Only Connections Matter
Euler realized the exact shapes of streets and islands do not matter. Only which land areas are connected by which bridges matters. Euler himself labeled the land areas with letters and recorded walks as strings of letters. In modern language, we draw each land area as a vertex (dot) and each bridge as an edge (line). This picture is a graph, and the number of edges at a vertex is its degree.
| Land area | Number of bridges (degree) |
|---|---|
| Kneiphof island (A) | 5 |
| North bank (B) | 3 |
| South bank (C) | 3 |
| Eastern island (D) | 3 |
The total is \(5 + 3 + 3 + 3 = 14\), twice the 7 bridges, because each bridge has two ends.
The Odd-Degree Rule
Whenever your walk passes through a land area, you use one bridge to enter and one to leave: two bridges. So every area you merely pass through must have an even number of bridges. Only the start and the end of the walk can have an odd number. Euler’s rule for a connected graph:
- 0 odd vertices: a walk using every edge once exists and can return to the start (an Euler circuit).
- 2 odd vertices: such a walk exists, starting at one odd vertex and ending at the other (an Euler path).
- More than 2 odd vertices: no such walk exists.
Königsberg has 4 odd vertices, so the walk is impossible.
A note on what was proved: the pairing argument shows that more than two odd vertices make the walk impossible. The other direction, that a walk always exists with zero or two odd vertices, needs a construction; Euler stated it, and Carl Hierholzer published a full proof in 1873.
About the date: 1736 is the traditional year. Euler presented the work in 1735, and it was printed in a journal volume dated 1736 that actually appeared in 1741.
Königsberg Today
Bombing in World War II and later rebuilding changed the bridges, and new crossings have been added over the years, so the answer for today’s city depends on which crossings you include. If you count only the five crossings that stand on the original bridge sites, two land areas have odd degree, so an Euler path does exist, though it must start and end in different places.
Why It Matters: Graph Theory
Euler’s solution is considered the first theorem of graph theory and an early idea of topology. Graphs now model road maps, social networks, the internet, molecules and electrical circuits. Related questions include the four color theorem and the much harder traveling salesman problem, where you must visit every vertex once rather than cross every edge once.
Try It Yourself
Can you draw an “envelope” shape (a square with an X inside and a triangle roof) without lifting your pen or retracing a line? Count the odd vertices: exactly two (the bottom corners), so yes, if you start at one of them.
Common Misconceptions
“Euler searched every possible route.” No. His argument shows impossibility without listing routes, which is what made it so powerful.
“Visiting every island once is the same problem.” No. Crossing every bridge (edge) once is the Euler problem; visiting every place (vertex) once is a Hamiltonian path problem, which is much harder in general.
Watch: The Seven Bridges of Königsberg in Video
If you learn better by watching, these videos are worth your time.
Check Your Understanding
Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.
Answer each question and press Submit to see your result right away.
Frequently Asked Questions
What is the seven bridges of Königsberg problem?
A puzzle asking whether you can walk through Königsberg crossing each of its seven bridges exactly once. Euler proved in 1736 that it is impossible.
Why is the Königsberg bridge walk impossible?
All four land areas had an odd number of bridges, but a walk crossing every bridge once can have at most two areas with an odd number.
What is the difference between an Euler path and an Euler circuit?
Both use every edge exactly once. An Euler circuit ends where it started and needs zero odd vertices; an Euler path starts and ends at different vertices and needs exactly two odd vertices.
What is an Euler path?
A walk in a graph that uses every edge exactly once. It exists in a connected graph exactly when there are zero or two vertices of odd degree.
How did the Königsberg problem start graph theory?
Euler ignored distances and shapes and kept only which land areas the bridges connect. This abstraction, now drawn as dots and lines, became graph theory.
Keep Exploring
Sources and Further Reading
Related to This Article
More math articles
- Liberal, Conservative and Moderate Ideologies: Key Differences
- HiSET Math Practice Test Questions
- 6th Grade OST Math FREE Sample Practice Questions
- Qualitative, Content, and Existing-Record Methods
- SAT Calculator Policy
- Find mutually beneficial terms of trade
- How to Calculate the Area, Perimeter, and Radius of Quarter Circles
- Resistor Color Code Calculator
- ASTB Math-Test Day Tips
- 4th Grade MEAP Math Practice Test Questions


What people say about "Seven Bridges of Königsberg: Euler’s Proof Explained - Effortless Math"?
No one replied yet.