For all sufficiently large n, every n-vertex graph with no suspension of P5 has at most floor(n^2/8) triangles, and the extremal graph is unique.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The generalized Tur\'an number for K_3 in graphs without suspensions of a path on five vertices
For all sufficiently large n, every n-vertex graph with no suspension of P5 has at most floor(n^2/8) triangles, and the extremal graph is unique.