This is the first problem that Will solves in the film Good Will Hunting. It is a fun and accessible maths problem, based on graph theory.
It can either be set as an extra-curricular activity or one for gifted, able and talented students to play around with (e.g. changing the number of nodes or connection rules).
It is actually known as homeomorphically irreducible trees problem.
It can either be set as an extra-curricular activity or one for gifted, able and talented students to play around with (e.g. changing the number of nodes or connection rules).
It is actually known as homeomorphically irreducible trees problem.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have downloaded this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£0.00