Title

The maximal number of induced r-partite subgraphs

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

Share

COinS