Zarankiewicz function
Meanings
name
- 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).
Word forms
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.