turán's theorem

/T ER1 N EH0 S TH IH0 R AH0 M/

noun

1
(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.

Translate “turán's theorem” into another language

Choose a language below to open the translator with English selected as the source language.