Turán's theorem
Cauliflower when used as an alternative to potatoes by followers of a low-carbohydrate diet.
Not extraneous.
Alternative form of weak-handed (as adverb)
(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.
組合せ論のゼミで、(r+1)-クリークを持たないn頂点の単純グラフの中でT(n,r)が最大の辺数を持つと述べるグラフ理論の定理（トゥラーンの定理）と、その極値構成がどのように(r+1)-クリークを回避するかを議論しました。
Don't have an account? Sign up
Do you have an account? Login
DiQt
Free
★★★★★★★★★★
