On the Turán number of Kλ1∪Kλ2

Liang Zhang and Jianhua Yin

Applied Mathematics and Computation, 2024, vol. 468, issue C

Abstract: Given a graph H, the Turán numberex(n,H) of H is the maximum number of edges of an n-vertex simple graph containing no H as a subgraph. Let Kλ1∪Kλ2 be the disjoint union of Kλ1 and Kλ2. For λ1=λ2=ρ+1≥3, Chen, Lu and Yuan determined the value ex(n,Kλ1∪Kλ2) completely. In this paper, we consider ex(n,Kλ1∪Kλ2) for λ1>λ2. We first give a lower bound on ex(n,Kλ1∪Kλ2), and then determine the value ex(n,Kλ1∪Kλ2) for λ1>λ2, λ2=2,3 and n≥λ1+λ2.

Keywords: Turán number; Disjoint copies; Kλ1∪Kλ2 (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323006902
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:468:y:2024:i:c:s0096300323006902

DOI: 10.1016/j.amc.2023.128521

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