The Turán number of star forests

Yongxin Lan, Tao Li, Yongtang Shi and Jianhua Tu

Applied Mathematics and Computation, 2019, vol. 348, issue C, 270-274

Abstract: The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices containing no H as a subgraph. Let Sℓ denote the star on ℓ+1 vertices and let k · Sℓ denote disjoint union of k copies of Sℓ. In this paper, for appropriately large n, we determine the Turán numbers for k · Sℓ and F, where F is a forest with components each of order 4, which improve the results of Lidický et al. (2013).

Keywords: Turán number; Extremal graphs; Star forests (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318310452
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:348:y:2019:i:c:p:270-274

DOI: 10.1016/j.amc.2018.12.004

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 ().