Turán's theorem

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]
English Wikipedia has an article on:
Wikipedia

Etymology

[edit]

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

Proper noun

[edit]

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.
[edit]