Abstract
Given a graph H and a positive integer n, the Turán number of H of the order n, denoted by ex(n, H), is the maximum size of a simple graph of order n that does not contain H as a subgraph. Given graphs G and H, \(G \vee H\) denotes the join of G and H. In this paper, we prove \(ex(n, K_m \vee C_{2k-1}) = \left\lfloor \frac{(m+1)n^2}{2(m+2)}\right\rfloor \) for \(n\ge 2(m+2)k-3(m+2)-1\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Bataineh, M.S.A., Jaradat, M.M.M., Jaradat, A.M.M.: Edge maximal graphs containing no specific wheels. Jordan J. Math. Stat. 8(2), 107–120 (2015)
Bollobás, B.: Extremal Graph Theory. Academic Press, London-New York (1978)
Bondy, J.A., Murty, U.S.R.: Graph Theory, in: GTM, vol. 244, Springer, (2008)
Dzido, T.: A note on Turán numbers for even wheels. Graphs Combin. 29(5), 1305–1309 (2013)
Dzido, T., Jastrzȩbski, A.: Turán numbers for odd wheels. Discrete Math. 341(4), 1150–1154 (2018)
Mantel, W.: Problem 28. Wiskundige Opgaven 10, 60–61 (1907)
Simonovits, M.: A method for solving extremal problems in graph theory, stability problems. In: Theory of Graphs. Academic Press, New York (1968)
Turán, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436–452 (1941)
Wang, L.: The Ramsey Numbers of Trees Versus Generalized 6-Wheels or Generalized 7-Wheels, Graphs Combin. 38 (2022), no. 5, Paper No. 153
Wang, L., Chen, Y.: The Ramsey numbers of trees versus generalized wheels. Graphs Combin. 35(1), 189–193 (2019)
West, D.B.: Introduction to Graph Theory. Prentice Hall Inc, Upper Saddle River, NJ (1996)
Xiao, C., Zamora, O.: A note on the Turán number of disjoint union of wheels, Discrete Math. 344 (2021), no. 11, 112570, 7
Yuan, L.: Extremal graphs for odd wheels. J. Graph Theory 98(4), 691–707 (2021)
Acknowledgements
This research was supported by the NSFC grant 12271170 and Science and Technology Commission of Shanghai Municipality (STCSM) grant 22DZ2229014.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no competing financial interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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.
About this article
Cite this article
Yan, J. On the Turán Number of \(K_m \vee C_{2k-1}\). Graphs and Combinatorics 40, 1 (2024). https://doi.org/10.1007/s00373-023-02728-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-023-02728-7