Some new results on the Turán number of star forests

Jiayun Li and Jianhua Yin

Applied Mathematics and Computation, 2021, vol. 407, issue C

Abstract: Let ex(n,G)=max{e(H)|Hisagraphwith|V(H)|=nandHcontainsnoG}, the Turán number of a graph G, where e(H)=|E(H)|. We determine ex(n,Sℓ1∪Sℓ2) for ℓ2≥3,ℓ1≥2ℓ2+2 and n≥2ℓ1+2ℓ2, where Sℓ is the star of order ℓ+1 and ∪ is the disjoint union. Moreover, we also determine ex(n,Sℓ1∪Sℓ2∪Sℓ3) for ℓ1≥ℓ2≥ℓ3≥1 and n≥max{M1,M2}, where both M1 and M2 are two parameters only depending on ℓ1,ℓ2 and ℓ3. This improves the corresponding results due to Lidický et al. (2013).

Keywords: Star; turán number; Sℓ1∪Sℓ2∪Sℓ3 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321004094
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:407:y:2021:i:c:s0096300321004094

DOI: 10.1016/j.amc.2021.126320

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().