English
Etymology
Named after the Hungarian mathematician Pál Turán.
Proper noun
Turán's theorem
- (graph theory) A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.
Hidden categories:
- Pages with entries
- Pages with 1 entry