The idea came from Panama’s 2026 Feria Científica Nacional del Ingenio Juvenil, a national youth science fair. Senacyt and the Ministry of Education reported that the virtual fair opened on November 16, with judging through November 18. Project FIM-02 in the catalogue, Mapeando la amistad, is a Cambridge Academy project about using graphs in a school context. The listing identifies the subject and the school. The activity below is Desbravai’s station game. It does not reproduce the students’ research or make claims about its results.
What is a graph and what makes a bridge?
A graph represents points and connections. In mathematics, the points can be called vertices and the connections are edges. If A connects to B and B connects to C, you can follow two edges to get from A to C without a direct link. The University of Nebraska–Lincoln’s maths text calls an edge a bridge when its removal creates a new separate group. The length of an edge in your drawing does not make it a bridge. You can find out by removing it and trying to get across.
Read alsoFecitba 2026 in Santarém: test a paper bridge with your Pathfinder unitMake two groups and lift one string away
Put A, B, and C on the left side of a sheet. Put D, E, and F on the right. Each letter stands for a station in the game, without representing a person. Lay down short pieces of string instead of drawing straight on the sheet. Then you can take one line away without affecting the others.
1. Make two triangles. Connect A to B, B to C, and C to A. On the other side, connect D to E, E to F, and F to D.
2. Join the two groups. Place a string from C to D. Show a teammate a route such as A, C, D, F. You have to follow a string for every step.
3. Take away A–B, then put it back. You can still go from A to B through C. The two groups stay connected as well.
4. Take away C–D. Try to go from A to F. From A, you can reach B and C. No string remains that takes you to D, E, or F. C–D was the bridge in the original graph.
Give your teammate a token that starts at A. Ask them to follow the available strings as far as they can. They cannot jump to a nearby letter that has no connection. This is how you show that the two groups are separate after removing C–D.
Add a connection and find a new route
Restore C–D and put down a second connection from B to E. Remove C–D again. You can now go from A to F by following A, B, E, F. Make a before-and-after drawing and add a sentence: “At first C–D was the only way between the groups. Now there is another connection.” Ask a different unit to point out a new route without reading your answer first.
If two strings cross in the drawing, the crossing is not a station. In this game you can change strings only at a letter. Move the letters or redraw one line if someone thinks the crossing is a stop. Changing the shape of the drawing need not change which places are connected.