Search by Topic

Resources tagged with Networks/Graph Theory similar to Sufficient but Not Necessary: Two Eyes and Seki in Go:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 29 results

Broad Topics > Decision Mathematics and Combinatorics > Networks/Graph Theory

problem icon

Behind the Rules of Go

Stage: 4 and 5

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.

problem icon

Sufficient but Not Necessary: Two Eyes and Seki in Go

Stage: 4 and 5

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.

problem icon

Fermat's Poser

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Find the point whose sum of distances from the vertices (corners) of a given triangle is a minimum.

problem icon

Travelling Salesman

Stage: 3 Challenge Level: Challenge Level:1

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?

problem icon

Factors and Multiples Graphs

Stage: 4 and 5 Challenge Level: Challenge Level:1

Explore creating 'factors and multiples' graphs such that no lines joining the numbers cross

problem icon

Königsberg

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

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 icon

Round-robin Scheduling

Stage: 2 and 3 Challenge Level: Challenge Level:1

Think about the mathematics of round robin scheduling.

problem icon

Tourism

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level: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 icon

Konigsberg Plus

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.

problem icon

Instant Insanity

Stage: 3, 4 and 5 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Given the nets of 4 cubes with the faces coloured in 4 colours, build a tower so that on each vertical wall no colour is repeated, that is all 4 colours appear.

problem icon

Dice, Routes and Pathways

Stage: 1, 2 and 3

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. . . .

problem icon

The Four Colour Theorem

Stage: 3 and 4

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. . . .

problem icon

Olympic Magic

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

in how many ways can you place the numbers 1, 2, 3 … 9 in the nine regions of the Olympic Emblem (5 overlapping circles) so that the amount in each ring is the same?

problem icon

Pattern of Islands

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...

problem icon

Magic Caterpillars

Stage: 4 and 5 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Label the joints and legs of these graph theory caterpillars so that the vertex sums are all equal.

problem icon

Only Connect

Stage: 3 Challenge Level: Challenge Level:1

The graph represents a salesman’s area of activity with the shops that the salesman must visit each day. What route around the shops has the minimum total distance?

problem icon

Ding Dong Bell

Stage: 3, 4 and 5

The reader is invited to investigate changes (or permutations) in the ringing of church bells, illustrated by braid diagrams showing the order in which the bells are rung.

problem icon

The Olympic Torch Tour

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

Imagine you had to plan the tour for the Olympic Torch. Is there an efficient way of choosing the shortest possible route?

problem icon

Plum Tree

Stage: 4 and 5 Challenge Level: Challenge Level:1

Label this plum tree graph to make it totally magic!

problem icon

Magic W

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

Find all the ways of placing the numbers 1 to 9 on a W shape, with 3 numbers on each leg, so that each set of 3 numbers has the same total.

problem icon

Tangles

Stage: 3 and 4

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

problem icon

Going Places with Mathematicians

Stage: 2 and 3

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. . . .

problem icon

Sprouts Explained

Stage: 2, 3, 4 and 5

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. . . .

problem icon

Symmetric Tangles

Stage: 4

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

problem icon

Classifying Solids Using Angle Deficiency

Stage: 3 and 4 Challenge Level: Challenge Level:1

Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry

problem icon

Knight Defeated

Stage: 4 Challenge Level: Challenge Level:1

The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board. . . .

problem icon

Geometry and Gravity 2

Stage: 3, 4 and 5

This is the second of two articles and discusses problems relating to the curvature of space, shortest distances on surfaces, triangulations of surfaces and representation by graphs.

problem icon

Tree Graphs

Stage: 4 Challenge Level: Challenge Level:1

A connected graph is a graph in which we can get from any vertex to any other by travelling along the edges. A tree is a connected graph with no closed circuits (or loops. Prove that every tree. . . .

problem icon

Some Circuits in Graph or Network Theory

Stage: 4 and 5

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