Maths WorkshopMaths problems with full solutions
Exercise 876Combinatorics › Counting principlesOlympiadAdded 3 Nov 2026

Counting cliques

#cliques#graphs#counting

Statement

In the complete graph KnK_n, how many triangles are there?

Hint

Choose 33 vertices.

Show solutionHide solution

Solution

Triangles. A triangle is a choice of 33 vertices: (n3)=n(n−1)(n−2)6\binom{n}{3}=\frac{n(n-1)(n-2)}{6}.

Conclusion. (n3)\binom{n}{3} triangles.