Indexed by：
Abstract：
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n,H,F). Let ℓ⋅F denote ℓ vertex disjoint copies of F. Győri and Li (2012) obtained results on ex(n,C3,C2k+1), which was further improved by Alon and Shikhelman (2016). In this paper, we determine the exact value of ex(n,C3,ℓ⋅C2k+1) and its extremal graph for all ℓ≥2 and large n. © 2024 Elsevier B.V.
Keyword：
Reprint 's Address：
Email：
Source ：
Discrete Mathematics
ISSN： 0012-365X
Year： 2024
Issue： 7
Volume： 347
0 . 7 0 0
JCR@2023
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
