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 simple graph has exactly 12 edges. Three of its vertices have degree 4, and every other vertex…
HardMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryNumericalOlympiad

A simple graph has exactly 12 edges. Three of its vertices have degree 4, and every other vertex…

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 simple graph has exactly 121212 edges. Three of its vertices have degree 444, and every other vertex has degree 333. There are no other vertices.

Find the number of vertices of degree 333 and the total number of vertices. Then check that such a graph really exists by the Havel–Hakimi test, or by describing one.

Check your answer

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

Need a reminder? The key ideaShowHide

The degrees add up to twice the number of edges, so the number of odd vertices is even. KnK_nKn​ has (n2)\dbinom{n}{2}(2n​) edges. A simple graph on nnn vertices with more than (n−12)\dbinom{n - 1}{2}(2n−1​) edges is connected.

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. The degree sum. 2E=242E = 242E=24.

Step 2. Solve. 3×4+3k=243 \times 4 + 3k = 243×4+3k=24, so k=4k = 4k=4 vertices of degree 333, and 3+4=73 + 4 = 73+4=7 vertices in all.

Step 3. Does it exist? Test 4, 4, 4, 3, 3, 3, 3. Remove a 444 and subtract 111 from the next four degrees: 3, 3, 2, 2, 3, 3, which sorts to 3, 3, 3, 3, 2, 2. Remove a 333: 2,2,2,2,22, 2, 2, 2, 22,2,2,2,2. That is the cycle C5C_5C5​, so every step works back to a real graph.

Check. 12+12=2412 + 12 = 2412+12=24.

Answer: 444 vertices of degree 333, and 777 vertices in all.

Log in to save this for later
← All Problems
← At a meeting each delegate shakes hands with some of the others, never twice with the same person…A computer network has 10 machines, and some pairs are joined by cables, at most one cable per pair… →
More onPigeonhole Principle, Recursion and Graph Theory

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Graphs, degrees and the handshake lemmaGraph 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
  • A river town has five land areas, A, B, C, D and E, joined by ten bridges…Hard
  • All problems on this topic →