Paper Info
Title
Some exact results for generalized Turan problems
Abstract
Fix a k-chromatic graph F. In this paper we consider the question to determine for which graphs H does the Turan graph Tk-1(n) have the maximum number of copies of H among all n-vertex F-free graphs (for n large enough). We say that such a graph H is F-Turan-good. In addition to some general results, we give (among others) the following concrete results:& nbsp;(i) For every complete multipartite graph H, there is k large enough such that H is K-k-Turan-good.& nbsp;(ii) The path P-3 is F-Turan-good for F with chi(F) >= 4.& nbsp;(iii) The path P-4 and cycle C-4 are C5-Turan-good.& nbsp;(iv) The cycle C-4 is F-2-Turan-good where F-2 is the graph of two triangles sharing exactly one vertex. (C)& nbsp;2022 Elsevier Ltd. All rights reserved.
Year
DOI
Venue
2022
10.1016/j.ejc.2022.103519
EUROPEAN JOURNAL OF COMBINATORICS
DocType
Volume
ISSN
Journal
103
0195-6698
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Dániel Gerbner14621.61
Cory Palmer24410.33