Turán Numbers for Disjoint Copies of Graphs | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Turán Numbers for Disjoint Copies of Graphs

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

Abstract

The Turán number \({ex(n,\mathcal H)}\) of \({\mathcal H}\) is the maximum number of edges of an n-vertex simple graph having no member of \({\mathcal H}\) as a subgraph. We show lower and upper bounds for Turán numbers for disjoint copies of graphs.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bollobás B.: Extremal graph theory. Dover Publications, Mineola (2004)

    MATH  Google Scholar 

  2. Bollobás B.: Modern graph theory. Springer-Verlag, New York (2002)

    Google Scholar 

  3. Diestel R.: Graph theory. Springer-Verlag, New York (1997)

    MATH  Google Scholar 

  4. Erdős P., Gallai T.: On maximal paths and circuits in graphs . Acta Math. Acad. Sci. Hung. 10, 337–356 (1959)

    Article  Google Scholar 

  5. Füredi Z., Naor A., Verstraëte J.: On the Turán number for the hexagon.. Adv. Math. 203, 476–496 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hajnal, A., Szemerédi, E.: Proof of a conjecture of Erdős. In: Erdős, P., Renyi, A., Sós, V.: (eds) Combinatorial Theory an its Applications, vol. II. Colloq. Math. Soc. J. Bolyai 4, North-Holland, pp. 1163–1164 (1970)

  7. Ore O.: Arc coverings of graphs. Ann. Math. Pure Appl. 55, 315–321 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  8. Simonovits M.: A method for solving extremal problems in extremal graph theory. In: Erdős, P., Katona, G. (eds) Theory of Graphs, pp. 279–319. Academic Press, New York (1968)

    Google Scholar 

  9. Shen J.: On two Turán numbers. J. Graph Theory 51, 244–250 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Lublin University of Technology, Nadbystrzycka 38D, 20-618, Lublin, Poland

    Izolda Gorgol

Authors
  1. Izolda Gorgol
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Izolda Gorgol.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gorgol, I. Turán Numbers for Disjoint Copies of Graphs. Graphs and Combinatorics 27, 661–667 (2011). https://doi.org/10.1007/s00373-010-0999-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0999-5

Keywords

Mathematics Subject Classification (2000)

Search

Navigation