Topology

problem
Favourite

Tourism

Age

11 to 16

Challenge level

2 out of 3

If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.
problem

Earth Shapes

Age

16 to 18

Challenge level

1 out of 3

What if the Earth's shape was a cube or a cone or a pyramid or a saddle ... See some curious worlds here.
problem

Travelling Salesman

Age

11 to 14

Challenge level

1 out of 3

A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?
game

Colouring Curves Game

Age

7 to 14

Challenge level

1 out of 3

In this game, try not to colour two adjacent regions the same colour. Can you work out a strategy?
problem

Icosian Game

Age

11 to 14

Challenge level

1 out of 3

This problem is about investigating whether it is possible to start at one vertex of a platonic solid and visit every other vertex once only returning to the vertex you started at.
problem

Königsberg

Age

11 to 14

Challenge level

2 out of 3

Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?
problem

The Bridges of Konigsberg

Age

11 to 18

Challenge level

1 out of 3

Investigate how networks can be used to solve a problem for the 18th Century inhabitants of Konigsberg.
problem

The Invertible Trefoil

Age

14 to 16

Challenge level

2 out of 3

When is a knot invertible ?
problem

Painting by Numbers

Age

16 to 18

Challenge level

1 out of 3

How many different colours of paint would be needed to paint these pictures by numbers?
problem

Torus Patterns

Age

16 to 18

Challenge level

3 out of 3

How many different colours would be needed to colour these different patterns on a torus?