Join free to take this lesson
Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.
11 steps ยท about 18 min
By the end you can
- Use degrees and the handshake lemma to count edges
- Decide whether a network has a route using every link exactly once
- Know that a tree on n vertices has n โ 1 edges, and find a shortest path
Who it is for: You have done lesson 6.4 (counting).
The steps
- Handshakes at a party
- Degrees and the handshake lemma
- Count the cables
- Sum of degrees
- Euler routes
- Can the inspector do it?
- Trees
- Connect the villages
- Shortest paths
- Find the shortest route
- An odd number of odd vertices?
Discussion 0 comments
Log in to join the discussion.