Seven Bridges of Königsberg Problem

A Seven Bridges of Königsberg Problem is a mathematical problem to devise a walk through the city of Königsberg that would cross each of the seven bridges once and only once.

• Context:
  • ...
• See: Leonhard Euler, Complete Bipartite Graph, Eulerian Cycle, Eulerian Path, Topology, Kneiphof, Oktyabrsky Island.

---

---

References

2023

• (Wikipedia, 2023) ⇒ https://en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg Retrieved:2023-8-5.
  • The Seven Bridges of Königsberg is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler in 1736 laid the foundations of graph theory and prefigured the idea of topology.

    The city of Königsberg in Prussia (now Kaliningrad, Russia) was set on both sides of the Pregel River, and included two large islands—Kneiphof and Lomse—which were connected to each other, and to the two mainland portions of the city, by seven bridges. The problem was to devise a walk through the city that would cross each of those bridges once and only once.

    By way of specifying the logical task unambiguously, solutions involving either

    1. reaching an island or mainland bank other than via one of the bridges, or
    2. accessing any bridge without crossing to its other end
  • are explicitly unacceptable.

    Euler proved that the problem has no solution. The difficulty he faced was the development of a suitable technique of analysis, and of subsequent tests that established this assertion with mathematical rigor.

---