Skip to main content
SpringerLink
Log in

Extremal Graphs for Two Vertex-Disjoint Copies of a Clique

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

Abstract

Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number of two vertex-disjoint copies of a clique.

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. Bielak, H., Kieliszek, S.: The Turán number of the graph \(3P_4\). Ann. Univ. Mariae Curie-Sklodowska Sect. A 68, 21–29 (2014)

    MathSciNet  MATH  Google Scholar 

  2. Bielak, H., Kieliszek, S.: The Turán number of the graph \(2P_5\). Discuss. Math. Graph Theory 36(3), 683–694 (2016)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Erdős, P.: über ein Extremalproblem in der Graphentheorie. Arch. Math. (Basel) 13, 122–127 (1962). (German)

    Article  Google Scholar 

  5. Faudree, R.J., Schelp, R.H.: Path Ramsey numbers in multicolourings. J. Combin. Theory B 19, 150–160 (1975)

    Article  Google Scholar 

  6. Hajnal, A., Szemerédi, E.: Proof of a conjecture of P. Erdős. In: Combinatorial theory and its applications, II (Proc. Colloq., Balatonfüred, 1969), pp 601–623. North-Holland, Amsterdam, (1970)

  7. Kopylov, G.N.: On maximal paths and cycles in a graph. Soviet Math. Dokl. 18, 593–596 (1977)

    MATH  Google Scholar 

  8. Füredi, Z., Gunderson, D.: Extremal numbers for odd cycles. Combin. Probab. Comput. 24, 641–645 (2015)

    Article  MathSciNet  Google Scholar 

  9. Moon, J.W.: On independent complete subgraphs in a graph. Can. J. Math. 20, 95–102 (1968)

    Article  MathSciNet  Google Scholar 

  10. Simonovits, M.: A method for solving extremal problems in extremal graph theory. In: Erdős, P., Katona, G. (eds) Theory of graphs (Proc. Colloq., Tihany), vol 1968. Academic Press, New York, pp 279–319 (1966)

  11. Turán, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok. 48, 436–452 (1941). (in Hungarian)

    MathSciNet  Google Scholar 

  12. Yuan, L.: A note on Turán’s theorem. Appl. Math. Comput. 361, 13–14 (2019)

    Article  MathSciNet  Google Scholar 

  13. Yuan, L., Zhang, X.: The Turán number of disjoint copies of paths. Discrete Math. 340(2), 132–139 (2017)

    Article  MathSciNet  Google Scholar 

  14. Yuan, L., Zhang, X.: Turán numbers for disjoint paths. J. Graph Theory 98(3), 499–524 (2021)

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work is supported by National Natural Science Foundation of China (No. 11871222, 11901554) and Science and Technology Commission of Shanghai Municipality (No. 18dz2271000, 19jc1420100).

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Shanghai Key Laboratory of PMMP, East China Normal University, Shanghai, 200241, China

    Wanfang Chen, Changhong Lu & Long-Tu Yuan

Authors
  1. Wanfang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Changhong Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Long-Tu Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Long-Tu Yuan.

Ethics declarations

Conflict of interest

The authors have not disclosed any competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work is supported by National Natural Science Foundation of China (No. 11871222, 11901554) and Science and Technology Commission of Shanghai Municipality (No. 18dz2271000, 19jc1420100)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, W., Lu, C. & Yuan, LT. Extremal Graphs for Two Vertex-Disjoint Copies of a Clique. Graphs and Combinatorics 38, 67 (2022). https://doi.org/10.1007/s00373-022-02467-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-022-02467-1

Keywords

Search

Navigation