AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (201.9 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

The generalized Turán number of 2 S

Yanjiao LiuJianhua Yin( )
School of Mathematics and Statistics, Hainan University, Haikou 570228, China
Show Author Information

Abstract

The generalized Turán number e x ( n , K s , H ) is defined to be the maximum number of copies of a complete graph K s in any H-free graph on n vertices. Let S denote the star on + 1 vertices, and let k S denote the disjoint union of k copies of S . Gan et al. and Chase determined e x ( n , K s , S ) for all integers s 3, 1 and n 1. In this paper, we determine e x ( n , K s , 2 S ) for all integers s 4, 1 and n 1.

CLC number: 05C35

References

【1】
【1】
 
 
AIMS Mathematics
Pages 23707-23712

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Liu Y, Yin J. The generalized Turán number of 2 S . AIMS Mathematics, 2023, 8(10): 23707-23712. https://doi.org/10.3934/math.20231205

576

Views

1

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 15 May 2023
Revised: 16 July 2023
Accepted: 27 July 2023
Published: 15 October 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)