Exact values for some unbalanced Zarankiewicz numbers

Abstract

For positive integers , , and , the Zarankiewicz number is defined to be the maximum number of edges in a bipartite graph with parts of sizes and that has no complete bipartite subgraph containing vertices in the part of size and vertices in the part of size . A simple argument shows that, for each , when . Here, for large , we determine the exact value of in almost all of the remaining cases where . We establish a new family of upper bounds on which complement a family already obtained by Roman. We then prove that the floor of the best of these bounds is almost always achieved. We also show that there are cases in which this floor cannot be achieved and others in which determining whether it is achieved is likely a very hard problem. Our results are proved by viewing the problem through the lens of linear hypergraphs and our constructions make use of existing results on edge decompositions of dense graphs.