Mathematics - Discrete Mathematics - Graph theory - Königsberg Bridge Problem

Show the famous Königsberg map: 4 land masses connected by 7 bridges. Challenge: 'Can you cross every bridge exactly once and return to start?' The student tries different paths (branching choices at each intersection). Every path fails! After 3-4 attempts, reveal: Euler proved it's impossible becau