Networks/graph theory
-
problemWithout taking your pencil off the paper or going over a line or passing through one of the points twice, can you follow each of the networks? -
problemRedblue
Investigate the number of paths you can take from one vertex to another in these 3D shapes. Is it possible to take an odd number and an even number of paths to the same vertex? -
problemHamilton's Puzzle
I start my journey in Rio de Janeiro and visit all the cities as Hamilton described, passing through Canberra before Madrid, and then returning to Rio. What route could I have taken? -
problemPattern of Islands
In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
-
problemKönigsberg
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?
-
problemClassifying Solids Using Angle Deficiency
Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry
-
problemThe Bridges of Konigsberg
Investigate how networks can be used to solve a problem for the 18th Century inhabitants of Konigsberg.
-
problemInstant Insanity
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.
-
problemKnight Defeated
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 for any value of n. How many ways can a knight do this on a 3 by 4 board?
-
problemOlympic Magic
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?