Back to Discover
🔢

Seven Bridges of Königsberg

math Maturity 11-13

A city had seven bridges.

Bridges of Konigsberg.png
Bridges of Konigsberg.png
People wanted to walk them all. They wanted to cross each bridge just once. A man named Euler tried to find a way. He found it was not possible. Can you find a path like that?
7 bridges.svg
7 bridges.svg

46 words
🖼️ Images & Media (7)
File:Bridges of Konigsberg.png
Bridges of Konigsberg.png
File:Konigsberg bridges.png
Konigsberg bridges.png
File:7 bridges.svg
7 bridges.svg
File:Königsberg graph.svg
Königsberg graph.svg
File:Present state of the Seven Bridges of Königsberg.png
Present state of the Seven Bridges of...
File:Old_cathedral_of_Kaliningrad_in_Russia.jpg
Old_cathedral_of_Kaliningrad_in_Russia.jpg
File:comparison_7_bridges_of_Konigsberg_5_room_puzzle_graphs.svg
comparison_7_bridges_of_Konigsberg_5_room_...
Up Next
🔢
Eulerian path
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Eulerian path 0% Handshaking lemma 0% Three utilities problem 0% Crossing number (graph theory) 0% Topology 0%

🔬 Go deeper

More advanced topics to explore

Handshaking lemma Three utilities problem Topology

🪜 Step back

Simpler topics to build understanding

Eulerian path Crossing number (graph theory) Turán's brick factory problem Complete graph
📚 Content adapted from Wikipedia | Readability: FK 12.2 | Vital Level 5