Abstract
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 Kővári, Sós and Turán on the minimum number of edges in a bipartite graph that has no large independent set, and the theorem of Hansel (also Katona and Szemerédi, Krichevskii) on the sum of the sizes of bipartite graphs that can be used to construct a graph (non-necessarily bipartite) that has no large independent set. Our results unify the underlying combinatorial principles developed in the proof of tight lower bounds for depth-two superconcentrators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kővári, T., Sós, V., Turán, P.: On a problem of k. zarankiewicz. Colloquium Mathematicum 3, 50–57 (1954)
Bollobás, B.: Extremal Graph Theory. Academic Press (1978)
Hansel, G.: Nombre minimal de contacts de fermature nécessaires pour réaliser une fonction booléenne symétrique de n variables. C. R. Acad. Sci. Paris 258, 6037–6040 (1964)
Katona, G., Szemerédi, E.: On a problem of graph theory. Studia Sci. Math. Hungar. 2, 23–28 (1967)
Krichevskii, R.E.: Complexity of contact circuits realizing a function of logical algebra. Sov. Phys. Dokl. 8, 770–772 (1964)
Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors and depth-two superconcentrators. SIAM J. Disc. Math. 13(1), 2–24 (2000)
Dutta, C., Radhakrishnan, J.: Tradeoffs in Depth-Two Superconcentrators. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 372–383. Springer, Heidelberg (2006)
Alon, N., Spencer, J.H.: The probabilistic method. Wiley-Interscience (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dutta, C., Radhakrishnan, J. (2012). More on a Problem of Zarankiewicz. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)