Consider the set of all n-vertex graphs that does not contain a k-clique. What is the maximum number of edges that any graph in this set have?