Follow your curiosity

What discovery has been shared with you?

Start with one fact. Explore it, go deeper, then follow whichever branch catches your imagination.

Choose subjects for a surprise

Exploring any topic

Begin your discovery

Your next discovery is one click away.

Choose one or more subjects above, or leave Any Topic selected and let curiosity decide.

Mathematics

Euler Paths and the Seven Bridges of Königsberg

Quick fact

Leonhard Euler proved that the seven bridges puzzle had no solution, but his reasoning led to the birth of graph theory—now essential in modern computing, logistics, and network design.

Why this is interesting

Imagine trying to stroll through a city crossing every bridge exactly once and returning home. In the 1700s, the residents of Königsberg asked this very question—and the answer changed mathematics forever.

Read the full explanation

Understanding Euler Paths and the Seven Bridges of Königsberg

In Königsberg (now Kaliningrad), four land areas were connected by seven bridges. The puzzle asked: can you start from one landmass, cross each bridge exactly once, and return to the start? Euler simplified each landmass to a point (vertex) and each bridge to a line (edge). He noticed that the number of bridges leading to each landmass (the degree of each vertex) determines whether such a route is possible. If a route uses each edge exactly once and starts and ends at the same vertex (an Euler circuit), every vertex must have an even degree. If you allow starting and ending at different vertices (an Euler path), exactly two vertices may have odd degree. In Königsberg, all four vertices had odd degree, so neither condition was met—impossible.

A deeper explanation

The mechanism behind Euler's insight is the degree of a vertex. Each time you enter a vertex via an edge, you must leave via a different edge. In a circuit that returns to the start, every vertex must have an even number of edges: for every time you enter, you leave. If you have a path (not a circuit), the starting and ending vertices will have one unmatched departure and entry, respectively, so they have odd degree. This simple counting argument makes the existence of Euler paths/circuits easy to check for any graph. Euler's work not only solved the puzzle but sparked graph theory, which now underpins modern routing algorithms (like GPS directions), network design (electrical circuits, social networks), and even DNA sequencing.

Keep FACTREE close

Internet access is required. Updates arrive when you reopen or reload the app. You may need to sign in again in the installed app.