The maximal number of induced r-partite subgraphs

Authors

Béla Bollobás, Faculty of MathematicsFollow
Yoshimi Egawa, Tokyo University of Science
Andrew Harris, London School of Economics and Political Science
Guoping Jin, Faculty of Mathematics

Abstract

In this paper, we extend earlier results concerning the maximal number of induced complete r-partite graphs in a graph G of order n. In particular, we show that if t > 1 + log r, then the maximal number of induced Kr(t)'s is achieved in the case of the Turán graph Tr(n), and that this bound on t is essentially best possible. © 1995 Springer-Verlag.

Publication Title

Graphs and Combinatorics

Recommended Citation

Bollobás, B., Egawa, Y., Harris, A., & Jin, G. (1995). The maximal number of induced r-partite subgraphs. Graphs and Combinatorics, 11 (1), 1-19. https://doi.org/10.1007/BF01787417