Skip to main content
SpringerLink
Log in

The maximal number of inducedr-partite subgraphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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 inducedK r (t)'s is achieved in the case of the Turán graphT r (n), and that this bound ont is essentially best possible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beineke, L.W., Harary, F.: The maximum number of strongly connected subtournaments, Can. Math. Bull.8, 491–498 (1965)

    Google Scholar 

  2. Bollobás, B.: Extremal Graph Theory, Academic Press, London-New York-San Francisco, pp. xx + 488 (1978)

    Google Scholar 

  3. Bollobás, B., Nara, C., Tachibana, S.: The maximal number of induced complete bipartite subgroups, Discrete Math.62, 271–275 (1986)

    Google Scholar 

  4. Brown, J., Sidorenko, A.: The inducibility of complete bipartite graphs, Journal of Graph Theory18, 629–645 (1994)

    Google Scholar 

  5. Erdös, P.: On the number of complete subgraphs contained in certain graphs, Publ. Math. Inst. Hungar. Acad. Sci.1, 459–464 (1962)

    Google Scholar 

  6. Exoo, G.: Dense packing of induced subgraphs, Ars Combinatoria22, 5–10 (1986)

    Google Scholar 

  7. Györi, E., Pach, J., Simonovits, M.: On the maximal number of certain subgraphs inK r -free graphs, Graphs and Combinatorics7, 31–37 (1991)

    Google Scholar 

  8. Moon, J.W., Moser, L.: On cliques in graphs, Israel J. Math.3, 23–28 (1965)

    Google Scholar 

  9. Pippenger, N., Golumbic, M.: The inducibility of graphs, J. Comb. Theory, Ser. B19, 189–203 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics, and Mathematical Statistics, Cambridge University, UK

    Béla Bollobás

  2. Department of Applied Mathematics, Science University of Tokyo, 162, Tokyo, Japan

    Yoshimi Egawa

  3. Department of Operational Research, London School of Economics, London, UK

    Andrew Harris

  4. Department of Pure Mathematics, and Mathematical Statistics, Cambridge University, UK

    Guoping Jin

Authors
  1. Béla Bollobás
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshimi Egawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrew Harris
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guoping Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bollobás, B., Egawa, Y., Harris, A. et al. The maximal number of inducedr-partite subgraphs. Graphs and Combinatorics 11, 1–19 (1995). https://doi.org/10.1007/BF01787417

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01787417

Keywords

Search

Navigation