The story
Named after the Polish mathematician Kazimierz Zarankiewicz, who proposed several special cases of the problem in 1951.
Etymology from Wiktionary, CC BY-SA 4.0.
Zarankiewicz problem
Today it means: 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. Full definition →