English Dictionary

Zarankiewicz function

固有名詞

(graph theory) The function for which the Zarankiewicz problem seeks a formula: z(m, n; s, t), denoting the largest possible number of edges in a bipartite graph G = (U, V, E) for which |U| = m and |V| = n, but which does not contain a subgraph of the form K_(s,t).

日本語の意味

双部グラフ G = (U, V, E) において、|U| = m, |V| = n となる頂点集合を持ち、部分グラフとして完全双部グラフ K_(s,t) を含まないという制約の下で構築可能な最大辺数を与える関数。

Recent progress on the Zarankiewicz function has shed light on extremal bipartite graphs that avoid large complete subgraphs.

ザランキエヴィチ問題が求める関数に関する最近の進展は、大きな完全部分グラフを含まない極値的な二部グラフの理解に光を当てた。

意味（1）

(graph theory) The function for which the Zarankiewicz problem seeks a formula: z(m, n; s, t), denoting the largest possible number of edges in a bipartite graph G = (U, V, E) for which |U| = m and |V| = n, but which does not contain a subgraph of the form K_(s,t).

the Zarankiewicz function （ canonical ）