Zarankiewicz problem (English, name)
expansion: the Zarankiewicz problem
Senses:
topics: graph-theory
mathematics
sciences
glosses: An unsolved problem in mathematics, asking for the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete bipartite subgraphs of a given size.
Forms:
form: the Zarankiewicz problem
tags: canonical