Turán's theorem en · PROPN
Etymology
Named after the Hungarian mathematician Pál Turán.
Meanings
- A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.
Dictionary
Words, grammatical forms and meanings linked to the ontology.