Word.ws English Dictionary

Turán's theorem

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.

Proper noun

Turán's theorem

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

Origin of Turán's theorem

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

Questions about Turán's theorem

What does Turán's theorem mean?
Turán's theorem means a theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.
What part of speech is Turán's theorem?
Turán's theorem is a proper noun.

Words near Turán's theorem in the dictionary

  1. Turville
  2. turwar
  3. Turán graph
  4. Turán graphs
  5. Turán's brick factory problem
  6. Turán's theorem
  7. Turáns
  8. Turín
  9. Tusa
  10. Tusas
  11. Tusayan

Source and license

Adapted from Wiktionary: Turán's theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Turán's theorem.” Word.ws, https://word.ws/tur%C3%A1n%27s_theorem. Based on Wiktionary, CC BY-SA 4.0.