Zarankiewicz function

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Proper noun[edit]

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 Ks,t.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Zarankiewicz_function&oldid=77974613"