Proper noun
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.