Zarankiewicz problem
English
[edit]
Etymology
[edit]Named after the Polish mathematician Kazimierz Zarankiewicz, who proposed several special cases of the problem in 1951.
Proper noun
[edit]the Zarankiewicz problem
- (graph theory) 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.