Graph theory starts with one of the least intimidating objects in math: dots connected by lines.
The dots are called vertices. The lines are called edges. That sounds almost too simple, but graphs can model roads, friendships, computer networks, tournament schedules, circuits, ecosystems, and the internet.
That is why graph theory works so well in a math circle. Students do not need a huge algebra background to enter the topic, but the questions become deep very quickly.
The Core Vocabulary
A graph is a set of vertices and edges.
The degree of a vertex is the number of edges touching it.
A path is a sequence of edges that lets you move from one vertex to another.
A cycle is a path that returns to where it started without repeating edges in between.
A graph is connected if every vertex can be reached from every other vertex.
That is enough vocabulary to ask surprisingly serious questions.
First Activity: Can You Draw This Without Lifting Your Pencil?
Give students a shape made of vertices and edges. Ask them whether they can trace every edge exactly once without lifting their pencil.
At first, most students guess by trying. That is good. Let them struggle.
Then ask them to look at the degrees of the vertices. A pattern appears:
- If every vertex has even degree, you can start and end at the same place.
- If exactly two vertices have odd degree, you can start at one odd vertex and end at the other.
- If more than two vertices have odd degree, the tracing is impossible.
Now the lesson becomes more than a puzzle. Students have discovered the idea behind an Euler path.
Why the Odd Vertices Matter
Every time you enter a vertex while tracing edges, you usually need to leave it too. That uses edges in pairs.
So most vertices need even degree.
Only the start and end vertices can be exceptions, because the start has one extra exit and the end has one extra entrance. That is why there can be either zero or two odd-degree vertices.
This is a proof hiding inside a drawing.
Real-World Version
Imagine a city inspector needs to drive every street in a neighborhood exactly once. The graph version asks whether such a route exists and where it must begin and end.
This connects the lesson to routing, delivery systems, trash collection, school buses, and network design.
The math is not separate from the world. It is a compressed language for it.
COSMO Challenge
Draw a connected graph with:
- exactly zero odd-degree vertices,
- exactly two odd-degree vertices,
- exactly four odd-degree vertices.
For each one, explain whether an Euler path exists and why.
Then try to create the smallest graph you can where an Euler path is impossible.
Takeaway
Graph theory teaches students that a picture can become an argument. Instead of solving by force, they learn to look for structure: degree, parity, connectedness, and constraints.
That is exactly the kind of thinking COSMO tries to build.