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

plural of gain of function

plural of gain of function

(programming) Synonym of lambda function

plural of anonymous function

plural of sink function

plural of Langevin function

plural of inclusion function

(mathematics) A real-valued function that is continuous everywhere but differentiable nowhere.

plural of Weierstrass function