Turán's theorem

短语

释义与例句

name
  1. 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.

    数学

词源

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

来源：wiktionary