Turán's theorem

English

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

Turán's theorem

(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.

单词	Turán's theorem
释义	Turán's theorem English Etymology Named after the Hungarian mathematician Pál Turán. Proper noun Turán's theorem (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. Related terms Turán graph
随便看	nakkich nakkie nakkies nakkikastike nakkikeitto nakkikioski Nakkila nakkilalainen nakkimakkara nakkin nakkipiilo nakkisormi nakkisota nakkisämpylä nakkoa nakkoya nakkulaine nakkuppaa nakkur nakkus nakkutilliineq naklada nakladatel nakladatelný nakladatelství