The maximal number of inducedr-partite subgraphs |
| |
| Authors: | Béla Bollobás Yoshimi Egawa Andrew Harris Guoping Jin |
| |
| Affiliation: | (1) Department of Pure Mathematics, and Mathematical Statistics, Cambridge University, UK;(2) Department of Applied Mathematics, Science University of Tokyo, 162 Tokyo, Japan;(3) Department of Operational Research, London School of Economics, London, UK;(4) Department of Pure Mathematics, and Mathematical Statistics, Cambridge University, UK |
| |
| Abstract: | In this paper, we extend earlier results concerning the maximal number of induced completer-partite graphs in a graphG of ordern. In particular, we show that ift > 1 + logr, then the maximal number of inducedKr(t)'s is achieved in the case of the Turán graphTr(n), and that this bound ont is essentially best possible. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
