Turán's theorem

English

Etymology

Named after the Hungarian mathematician Pál Turán.

Proper noun

Turán's theorem

  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.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.