Back to Search
Start Over
The maximum number of triangles in [formula omitted]-free graphs.
- Source :
-
European Journal of Combinatorics . Dec2023, Vol. 114, pN.PAG-N.PAG. 1p. - Publication Year :
- 2023
-
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) ≤ (9 k − 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 ≥ 4 k 3 . [ABSTRACT FROM AUTHOR]
- Subjects :
- *COMPLETE graphs
*TRIANGLES
*HYPERGRAPHS
*FRIENDSHIP
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 114
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 172307974
- Full Text :
- https://doi.org/10.1016/j.ejc.2023.103793