Turán's theorem

Etymology
Named after the Hungarian mathematician.

Proper noun

 * 1)  A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.