Turán's theorem

theorem bounding the number of edges in a graph that has no large cliques