Abstract
The generalized Turán number ex(n,Ks,F) denotes the maximum number of copies of Ks in an n-vertex F-free graph. Let kF denote k disjoint copies of F. Gerbner et al. (2019) [8] gave a lower bound for ex(n,K3,2C5) and obtained the magnitude of ex(n,Ks,kKr). In this paper, we determine the exact value of ex(n,K3,2C5) and described the unique extremal graph for large n. Moreover, we also determine the exact value of ex(n,Kr,(k+1)Kr) which generalizes some known results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
