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 has exactly one more vertex than it has edges.
Factors and Multiples Graphs
Age 14 to 18 Challenge Level:
In this example, Steve chose the numbers $2, \dots, 10$ and was able to link the factor and multiple pairs without lines crossing.
The NRICH Project aims to enrich the mathematical experiences of all learners. To support this aim, members of the
NRICH team work in a wide range of capacities, including providing professional development for teachers wishing to
embed rich mathematical tasks into everyday classroom practice.