More on a Problem of Zarankiewicz
ALGORITHMS AND COMPUTATION, ISAAC 2012, pp. 257-266, 2012.
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of Kovari, Sos and Turan on the minimum number of edges in a bipartit...More
Full Text (Upload PDF)
PPT (Upload PPT)