A Note on the Number of Triangles in Graphs Without the Suspension of a Path on Four Vertices
Dániel Gerbner · Discrete Mathematics Letters · 2022
The suspension of the path P4 consists of a P4 and an additional vertex adjacent to each of the four vertices, and is denoted by P4.The largest number of triangles in a P4-free n-vertex graph is denoted by ex(n, K3, P4).Mubayi and Mukherjee showed in the preprint [arXiv:2004[arXiv: .11930,(2020))] that ex(n, K3, P4) = n 2 /8 + O(n).For sufficiently large n, it is shown here that ex(n, K3, P4) = n 2 /8 .