I am struggling to solve the following problem.
We have a simple (no loops or multiple edges) undirected graph with $n$ nodes. We are told that the graph does not contain any cliques with $m$ nodes ($m \leq n$). What is the most number of edges that this graph can have?