Zarankiewicz function

English

Proper noun

the Zarankiewicz function

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.