Turán's theorem

proper noun

A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.

Meanings

proper noun
  1. graph theoryA theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.

Origin

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

Full word history & related roots →
Cite this entry
APA

Turán's theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/Tur%C3%A1n's%20theorem

MLA

“Turán's theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Tur%C3%A1n's%20theorem. Accessed November 5, 2026.

Chicago

WatkinsX Dictionary, s.v. “Turán's theorem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/Tur%C3%A1n's%20theorem.

Source: Turán's theorem on Wiktionary, CC BY-SA 4.0.