Extremal K(s,t)-free bipartite graphs

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In this paper new exact values of the Zarankiewicz function z(m, n; s, t) are obtained assuming certain requirements on the parameters. Moreover, all the corresponding extremal graphs are characterized. Finally, an extension of this problem to 3-partite graphs is studied. © 2008 Discrete Mathematics and Theoretical Computer Science (DMTCS).

Cite

CITATION STYLE

APA

Balbuena, C., Garcĺa-Vázquez, P., Marcote, X., & Valenzuela, J. C. (2008). Extremal K(s,t)-free bipartite graphs. Discrete Mathematics and Theoretical Computer Science, 10(3), 35–48. https://doi.org/10.46298/dmtcs.435

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free