Skip to main content
Log in

Abstract

Given a graph H and a positive integer n,  the Turán number of H for the order n,  denoted by \(\textrm{ex}(n,H),\) is the maximum size of a simple graph of order n not containing H as a subgraph. The book with p pages, denoted by \(B_p\), is the graph that consists of p triangles sharing a common edge. Bollobás and Erdős initiated the research on the Turán number of book graphs in 1975. The two numbers \(\textrm{ex}(p+2,B_p)\) and \(\textrm{ex}(p+3,B_p)\) have been determined by Qiao and Zhan. In this paper we determine the numbers \(\textrm{ex}(p+4,B_p),\) \(\textrm{ex}(p+5,B_p)\) and \(\textrm{ex}(p+6,B_p),\) and characterize the corresponding extremal graphs for the numbers \(\textrm{ex}(n,B_p)\) with \(n=p+2,\,p+3,\,p+4,\,p+5.\)

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. B. Bollobás, Extremal Graph Theory, Academic Press, London-New York, 1978.

    MATH  Google Scholar 

  2. B. Bollobás and P. Erdős, Unsolved problems, in Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), pp.678-696, Utilitas Math., Winnipeg, Man., 1976.

  3. C.S. Edwards, A lower bound for the largest number of triangles with a common edge (unpublished manuscript), 1977.

  4. W. Mantel, Problem 28, Wiskundige Opgaven, 10(1907), 60-61.

    Google Scholar 

  5. P. Qiao and X. Zhan, On a problem of Erdős about graphs whose size is the Turán number plus one, Bull. Aust. Math. Soc., 105(2022), 177-187.

    Article  MathSciNet  MATH  Google Scholar 

  6. D.B. West, Introduction to Graph Theory, Prentice Hall, Inc., 1996.

    MATH  Google Scholar 

Download references

Acknowledgements

This research was supported by the NSFC grant 12271170 and Science and Technology Commission of Shanghai Municipality grant 22DZ2229014.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xingzhi Zhan.

Additional information

Communicated by Shariefuddin Pirzada.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yan, J., Zhan, X. The Turán number of book graphs. Indian J Pure Appl Math (2023). https://doi.org/10.1007/s13226-023-00467-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13226-023-00467-2

Keywords

Mathematics Subject Classification

Navigation