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. /The 15 edges of K₆ are coloured red or blue…
AdvancedMathematicsHigh School (11–12)Pigeonhole Principle, Recursion and Graph TheoryproofNumericalOlympiad

The 15 edges of K₆ are coloured red or blue…

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.

The 151515 edges of K6K_6K6​ are coloured red or blue. We know there is always one one-colour triangle. In fact there are always at least two.

Prove this. Call a pair of edges at a vertex mixed when they have different colours. Count mixed pairs at each vertex: a vertex with rrr red and 5−r5 - r5−r blue edges has r(5−r)r(5 - r)r(5−r) mixed pairs, at most 666. A triangle that is not one colour has exactly two corners with a mixed pair. Find the most triangles that are not one colour, and so the fewest one-colour triangles.

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. Mixed pairs. At a vertex with rrr red edges there are r(5−r)≤6r(5 - r) \le 6r(5−r)≤6 mixed pairs. Over 666 vertices there are at most 363636.

Step 2. Triangles that are not one colour. Such a triangle has two edges of one colour and one of the other. Exactly two of its corners see a mixed pair. Each mixed pair at a vertex lies in exactly one triangle.

Step 3. Count. So the number of triangles that are not one colour is (mixed pairs) ÷2≤18\div 2 \le 18÷2≤18.

Step 4. One-colour triangles. At least 20−18=220 - 18 = 220−18=2.

Check. Two disjoint red triangles with all other edges blue have exactly 222 one-colour triangles. The program below tries all 2152^{15}215 colourings and confirms the minimum.

Answer: at most 363636 mixed pairs, so at least 222 one-colour triangles. Proof complete.

Log in to save this for later
← All Problems
← Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…A welder builds a triangular frame ABC from steel bars with AB = 12 cm, AC = 8 cm and BC = 15 cm… →
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. Three houses each need a path to each of three wells, nine paths in all, drawn on flat ground…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
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 →