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 connected planar graph with 10 vertices is drawn without crossings, and every face of the…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalOlympiad

A connected planar graph with 10 vertices is drawn without crossings, and every face of the…

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 connected planar graph with 101010 vertices is drawn without crossings, and every face of the drawing, the outside face included, is bounded by exactly 333 edges. Such a drawing is called a triangulation.

Find the number of edges and the number of faces. Use the fact that each edge borders exactly two faces, together with Euler's formula. Then explain why no simple planar graph on 101010 vertices can have more edges than this one.

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. Faces and edges. Each face has 333 edges and each edge borders 222 faces, so 3F=2E3F = 2E3F=2E.

Step 2. Euler's formula. 10−E+2E3=210 - E + \dfrac{2E}{3} = 210−E+32E​=2, so E3=8\dfrac{E}{3} = 83E​=8 and E=24E = 24E=24.

Step 3. Faces. F=2×243=16F = \dfrac{2 \times 24}{3} = 16F=32×24​=16. Check: 10−24+16=210 - 24 + 16 = 210−24+16=2.

Step 4. The most edges. Any simple planar graph with V≥3V \ge 3V≥3 has E≤3V−6=24E \le 3V - 6 = 24E≤3V−6=24. A triangulation reaches the bound, so no planar graph on 101010 vertices has more edges.

Answer: 242424 edges and 161616 faces.

Log in to save this for later
← All Problems
← The complete bipartite graph K_(m,n) joins each of m left vertices to each of n right vertices…Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground… →
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. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…Advanced
  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 →