EEduVistaHQ

Euler Paths and the Konigsberg Bridges

Decide whether a route can cross every bridge once and discover the rule that solves every such puzzle.

Grade 9Math OlympiadMathLogicGeometryNumber SenseIntermediate50 to 80 min4 materials

What you'll learn

  • Model a map as a graph of vertices and edges
  • Find the degree of each vertex
  • State and apply Euler's rule for paths and circuits

Objective

Investigate which networks can be traced without lifting the pencil and discover the odd vertex rule.

STEM concepts

Graph theoryNetworksParityModeling
Ready to do this one?Sign in or create a free parent account to unlock projects. Each family opens a couple of projects per grade every month, so there is always something new to come back to.
Sign up free
Materials and safety
Step-by-step instructions
Prediction, test sheet and results
Why does it work, challenge and project report

Try another STEM challenge

EduVistaHQ.com · Learn • Explore • Grow