Generalized Turán Number of Even Linear Forests

The generalized Turán number e x ( n , K s , H ) is defined to be the maximum number of copies of a complete graph K s in any H -free graph on n vertices. Let F be an even linear forest, that is, F consists of paths of even order. In this paper, we determine the value of e x ( n , K s , F ) , which...

Full description

Saved in:
Bibliographic Details
Published inGraphs and combinatorics Vol. 37; no. 4; pp. 1437 - 1449
Main Authors Zhu, Xiutao, Zhang, Fangfang, Chen, Yaojun
Format Journal Article
LanguageEnglish
Published Tokyo Springer Japan 2021
Springer Nature B.V
Subjects
Apexes
Combinatorics
Engineering Design
Graph theory
Mathematics
Mathematics and Statistics
Original Paper
Turán number
Generalized Turán number
Even linear forests
Online AccessGet full text

Cover

More Information
Summary:The generalized Turán number e x ( n , K s , H ) is defined to be the maximum number of copies of a complete graph K s in any H -free graph on n vertices. Let F be an even linear forest, that is, F consists of paths of even order. In this paper, we determine the value of e x ( n , K s , F ) , which generalizes or improves some known results on generalized Turán number and classical Turán number.
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-021-02329-2