Networks/graph theory

This article explains the use of the idea of connectedness in networks, in two different ways, to bring into focus the basics of the game of Go, namely capture and territory.

The game of go has a simple mechanism. This discussion of the principle of two eyes in go has shown that the game does not depend on equally clear-cut concepts.

This article for teachers discusses examples of problems in which there is no obvious method but in which children can be encouraged to think deeply about the context and extend their ability to think mathematically, especially geometrically.

This article invites you to get familiar with a strategic game called "sprouts". The game is simple enough for younger children to understand, and has also provided experienced mathematicians with significant food for thought.

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

This article looks at the importance in mathematics of representing places and spaces mathematics. Many famous mathematicians have spent time working on problems that involve moving and mapping things.

Some simple ideas about graph theory with a discussion of a proof of Euler's formula relating the numbers of vertces, edges and faces of a graph.

A personal investigation of Conway's Rational Tangles. What were the interesting questions that needed to be asked, and where did they lead?

The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!

The Four Colour Conjecture was first stated just over 150 years ago, and finally proved conclusively in 1976. It is an outstanding example of how old ideas can be combined with new discoveries. prove a mathematical theorem.