Gerbner, Dániel and Palmer, Cory (2022) Some exact results for generalized Turan problems. EUROPEAN JOURNAL OF COMBINATORICS, 103. ArtNo: 103519. ISSN 0195-6698 (nyomtatott), 1095-9971 (online)
|
Text
2006_03756v1.pdf Download (204kB) | Preview |
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: (i) For every complete multipartite graph H, there is k large enough such that H is K-k-Turan-good. (ii) The path P-3 is F-Turan-good for F with chi(F) >= 4. (iii) The path P-4 and cycle C-4 are C5-Turan-good. (iv) The cycle C-4 is F-2-Turan-good where F-2 is the graph of two triangles sharing exactly one vertex.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 21 Mar 2023 16:33 |
| Last Modified: | 06 Apr 2023 14:20 |
| URI: | http://real.mtak.hu/id/eprint/162530 |
Actions (login required)
 |
Edit Item |
