Activity: The Seven Bridges of Königsberg

The old town of Königsberg has seven bridges:

Can you take a walk through the town, visiting each part of the town
and crossing each bridge only once?

This question was given to a famous mathematician called Leonhard Euler... but let's try to answer it ourselves!

And along the way we will learn a little about "Graph Theory".

Simplifying It

We can simplify the map above to just this:

There are four areas of the town - on the mainland north of the river, on the mainland south of the river, on the island and on the peninsula (the piece of land on the right)

Let us label them A, B, C and D:

To "visit each part of the town" you should visit the points A, B, C and D. And you should cross each bridge p, q, r, s, t, u and v just once.

And we can further simplify it to this:

So instead of taking long walks through the town,
you can now just draw lines with a pencil.

Your Turn

Have a try and see if you can.

...

Did you succeed?

Well ... let's take a step back and try some simpler shapes.

Try these (remember: draw all the lines, but never go over any line more than once, and don't remove your pencil from the paper.)

Put your results here:

So, How Can We Know Which Ones Work and Which Ones Do Not?

Let's investigate!

But first, time to learn some special words:

A point is called a vertex (plural vertices) A line is called an edge. The whole diagram is called a graph.

Yes, it is called a "Graph"... but it is NOT this kind of graph: They are both called "graphs". But they are different things. Just how it is.

The number of edges that lead to a vertex is called the degree.

A route around a graph that visits every vertex once is called a simple path. A route around a graph that visits every edge once is called an Euler path.

Examples:

Diagram 7 has 5 vertices: A, B, C, D and E 8 edges: AB, BC, CD, DA, AE, BE, AC and BD Vertices A and B have degree 4 Vertices C and D have degree 3 Vertex E has degree 2		Diagram 8 has 6 vertices: A, B, C, D, E and F 10 edges: AB, BC, CD, DA, AF, BF,CF, DF, AE and BE Vertices A, B and F have degree 4 Vertices C and D have degree 3 Vertex E has degree 2

Euler Path

OK, imagine the lines are bridges. If you cross them once only you have solved the puzzle, so ...

... what we want is an "Euler Path" ...

... and here is a clue to help you: we can tell which graphs have an "Euler Path" by counting how many vertices have an odd degree.

So, fill out this table:

Is there a pattern?

Don't read any further until you have found some kind of pattern ... the answer is in the table.

And the reason is not hard to understand.

A path leads into a vertex by one edge and out by a second edge.

So the edges should come in pairs (an even number).

Only the start and end point can have an odd degree.

Now Back to the Königsberg Bridge Question:

Vertices A, B and D have degree 3 and vertex C has degree 5, so this graph has four vertices of odd degree. So it does not have an Euler Path.

We have solved the Königsberg bridge question just like Euler did nearly 300 years ago!

Bonus Exercise: Which of the following graphs have Euler Paths?