REAL

Generalized outerplanar Turán number of short paths

Győri, Ervin and Addisu, Paulos and Chuanqi, Xiao (2023) Generalized outerplanar Turán number of short paths. DISCRETE MATHEMATICS, 346 (1). ISSN 0012-365X

[img]
Preview
Text
2110_06921v2.pdf

Download (420kB) | Preview

Abstract

Let H be a graph. The generalized outerplanar Turán number of H, denoted by fOP(n,H), is the maximum number of copies of H in an n-vertex outerplanar graph. Let Pk denote a path on k vertices. In this paper we give an exact value of fOP(n,P4) and a best asymptotic value of fOP(n,P5). Moreover, we characterize all outerplanar graphs containing fOP(n,P4) copies of P4. © 2022 Elsevier B.V.

Item Type: Article
Additional Information: Export Date: 19 October 2022 CODEN: DSMHA Correspondence Address: Paulos, A.; Central European UniversityHungary; email: addisu_2004@yahoo.com Funding details: National Research, Development and Innovation Office, K126853, K132696 Funding text 1: The research of all the authors was partially supported by the National Research, Development and Innovation Office NKFIH, grants K132696 , and K126853 .
Uncontrolled Keywords: outerplanar graph; Maximal outerplanar graph; Generalized outerplanar Turán number;
Subjects: Q Science / természettudomány > QA Mathematics / matematika
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 22 Mar 2023 12:47
Last Modified: 06 Apr 2023 13:48
URI: http://real.mtak.hu/id/eprint/162576

Actions (login required)

Edit Item Edit Item