Zarankiewicz problem
plural of elurophobe
synovia
(graph theory) An unsolved problem in mathematics, asking for the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete bipartite subgraphs of a given size.
A compound of this type. / (chiefly in the plural) A petroleum fraction containing no aromatic compounds
極値グラフ理論を研究していた彼女は、与えられた頂点数で特定の大きさの完全二部グラフを含まない二部グラフの辺の最大数を求める未解決問題であるザランキエヴィッチ問題に論文を捧げ、一般解に一歩近づくことを期待した。
Don't have an account? Sign up
Do you have an account? Login
DiQt
Free
★★★★★★★★★★
