Turán's theorem

From Wiktionary, the free dictionary
Archived revision by Equinox (talk | contribs) as of 15:33, 8 May 2018.
Jump to navigation Jump to search

English

English Wikipedia has an article on:
Wikipedia

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.