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. /Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryproofNumericalOlympiad

Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…

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.

Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground. The paths may bend but may not cross. This is the graph K3,3K_{3,3}K3,3​.

Prove that the nine paths cannot all be drawn. Explain why every face of a planar drawing of K3,3K_{3,3}K3,3​ would need at least 444 edges. Use Euler's formula to find the largest number of edges a planar graph on 666 vertices with no triangle can have. Then do the same for K5K_5K5​, with 3V−63V - 63V−6.

Check your answer

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

Need a reminder? The key ideaShowHide

For a connected planar drawing V−E+F=2V - E + F = 2V−E+F=2. A simple planar graph with V≥3V \ge 3V≥3 has E≤3V−6E \le 3V - 6E≤3V−6, and E≤2V−4E \le 2V - 4E≤2V−4 when it has no triangle. Every red and blue colouring of K6K_6K6​ has a one-colour triangle.

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. No triangle. K3,3K_{3,3}K3,3​ is bipartite, so every cycle has even length. A face is bounded by a cycle, so it has at least 444 edges.

Step 2. Count. 4F≤2E4F \le 2E4F≤2E, so F≤E2F \le \dfrac{E}{2}F≤2E​. Euler's formula gives 2=V−E+F≤V−E22 = V - E + F \le V - \dfrac{E}{2}2=V−E+F≤V−2E​, so E≤2V−4=8E \le 2V - 4 = 8E≤2V−4=8 for V=6V = 6V=6.

Step 3. Contradiction. K3,3K_{3,3}K3,3​ has 999 edges, more than 888. So no planar drawing exists.

Step 4. K5K_5K5​. Here faces have at least 333 edges, so E≤3V−6=9E \le 3V - 6 = 9E≤3V−6=9. But K5K_5K5​ has 101010 edges, so it is not planar either.

Answer: the bounds are 888 and 999, and K3,3K_{3,3}K3,3​ and K5K_5K5​ exceed them. Proof complete.

Log in to save this for later
← All Problems
← A connected planar graph with 10 vertices is drawn without crossings, and every face of the…The 15 edges of K₆ are coloured red or blue… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Planar graphs, colouring and Ramsey numbersGraph Theory

More on this topic

  1. The 15 edges of K₆ are coloured red or blue…Advanced
  2. A connected planar graph with 10 vertices is drawn without crossings, and every face of the…Hard
  3. The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…Advanced
  4. A river town has five land areas, A, B, C, D and E, joined by ten bridges…
Hard
  • In a group of 6 students, some pairs are friends…Advanced
  • All problems on this topic →