Zhu, X. and Chen, Y. and Gerbner, Dániel and Győri, Ervin and Hama Karim, Hilal (2023) The maximum number of triangles in Fk-free graphs. EUROPEAN JOURNAL OF COMBINATORICS, 114. ISSN 0195-6698
|
Text
1-s2.0-S0195669823001105-main.pdf Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (568kB) | Preview |
Abstract
The generalized Turán number ex(n , K s , H) is the maximum number of complete graph K s in an H-free graph on n vertices. Let F k be the friendship graph consisting of k triangles. Erdős and Sós (1976) determined the value of ex(n , K 3 , F 2 ). Alon and Shikhelman (2016) proved that ex(n , K 3 , F k ) ≤ (9k − 15)(k + 1)n . In this paper, by using a method developed by Chung and Frankl in hypergraph theory, we determine the exact value of ex(n , K 3 , F k ) and the extremal graph for any F k when n ≥ 4k 3
| Item Type: | Article |
|---|---|
| Additional Information: | Department of Mathematics, Nanjing University, Nanjing, 210093, China Alfréd Rényi Institute of Mathematics, Budapest, Hungary Department of Computer Science and Information Theory, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Budapest, Hungary Export Date: 14 September 2023 CODEN: EJOCD |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 30 Mar 2024 20:56 |
| Last Modified: | 30 Mar 2024 20:56 |
| URI: | https://real.mtak.hu/id/eprint/191305 |
Actions (login required)
 |
Edit Item |
