HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A river town has five land areas, A, B, C, D and E, joined by ten bridges…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalreasoningOlympiad

A river town has five land areas, A, B, C, D and E, joined by ten bridges…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

A river town has five land areas, AAA, BBB, CCC, DDD and EEE, joined by ten bridges. There are two bridges between AAA and BBB and two between CCC and DDD. There is one bridge each for AAA to CCC, BBB to CCC, BBB to DDD, BBB to EEE, CCC to EEE and DDD to EEE. The figure shows the map as a multigraph.

Five land areas A, B, C, D and E drawn as circles, joined by ten bridges drawn as lines: two curved lines between A and B, two curved lines between C and D, and single lines A to C, B to C, B to D, B to E, C to E and D to E. Each area is labelled with its number of bridges: A 3, B 5, C 5, D 4, E 3.

Find how many land areas have an odd number of bridges. Can a visitor cross every bridge exactly once? Find the fewest new bridges that make such a walk possible, and the fewest that make a walk possible that also ends where it started.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

A tree on nnn vertices has n−1n - 1n−1 edges; a forest with ccc components has n−cn - cn−c. Bipartite means no odd cycle; with no triangle, E≤n24E \le \dfrac{n^2}{4}E≤4n2​. A connected graph has an Euler circuit when all degrees are even, and an Euler trail when exactly two are odd.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Degrees. AAA: 2+1=32 + 1 = 32+1=3. BBB: 2+1+1+1=52 + 1 + 1 + 1 = 52+1+1+1=5. CCC: 1+1+2+1=51 + 1 + 2 + 1 = 51+1+2+1=5. DDD: 2+1+1=42 + 1 + 1 = 42+1+1=4. EEE: 1+1+1=31 + 1 + 1 = 31+1+1=3. The sum is 20=2×1020 = 2 \times 1020=2×10.

Step 2. Odd areas. AAA, BBB, CCC and EEE: 444 odd areas. The map is connected, but an Euler trail allows at most 222 odd vertices, so no such walk exists now.

Step 3. One new bridge. A bridge from AAA to EEE makes both even, leaving BBB and CCC odd. Now an Euler trail exists, from BBB to CCC. One new bridge cannot leave fewer than 222 odd areas, so 111 is the fewest for a trail.

Step 4. A closed walk. All four odd areas must become even, and each new bridge fixes at most two of them. So at least 222 bridges are needed, and AAA to EEE with BBB to CCC works.

Answer: 444 odd areas; 111 new bridge for a walk, 222 for a closed walk.

Log in to save this for later
← All Problems
← In a group of 6 students, some pairs are friends…The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Trees, bipartite graphs and Euler trailsGraph Theory

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  3. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  4. The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…
Advanced
  • In a group of 6 students, some pairs are friends…Advanced
  • All problems on this topic →