I will show now an application of this result to the last problem we will consider in this course, which is the maximum clique problem. The instance of this problem is a graph. The solution is a set of nodes, which are all adjacent to each other. And we want to find the maximum cardinality of such set.

---