Abdul Basit

Zarankiewicz's problem in extremal graph theory asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain a copy of $K_{k,k}$, the complete bipartite with $k$ vertices in both classes. We will consider this...