The -Turán graph is the Extremal Graph on Vertices which contains no
-Clique. In other words, the Turán graph has the maximum possible number of Edges of
any -vertex graph not containing a Complete Graph . Turán's Theorem gives
the maximum number of edges for the -Turán graph. For ,
See also Clique, Complete Bipartite Graph, Turán's Theorem
References
Aigner, M. ``Turán's Graph Theorem.'' Amer. Math. Monthly 102, 808-816, 1995.