The outerplanar Turán number of disjoint copies of paths

Jin Li, Yongxin Lan and Changqing Xu

Applied Mathematics and Computation, 2025, vol. 494, issue C

Abstract: A graph without a copy of T as a subgraph is called T-free. The outerplanar Turán number exOP(n,T) of T represents the maximum number of edges among all n-vertex T-free outerplanar graphs. In this paper, we investigate exOP(n,rPs) and determine its exact value for r,s≥2 and n≥rs. This extends a result of Fang and Zhai (2023) [7].

Keywords: Outerplanar graph; Turán number; Path (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325000232
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:494:y:2025:i:c:s0096300325000232

DOI: 10.1016/j.amc.2025.129296

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