A note on the number of triangles in graphs without the suspension of a path on four vertices

preprint2022arXivOpen access

Abstract

The suspension of the path P4P_4 consists of a P4P_4 and an additional vertex connected to each of the four vertices, and is denoted by P4^\hat{P_4}. The largest number of triangles in a P4^\hat{P_4}-free nn-vertex graph is denoted by ex(n,K3,P4^)ex(n,K_3,\hat{P_4}). Mubayi and Mukherjee in 2020 showed that ex(n,K3,P4^)=n2/8+O(n) ex(n,K_3,\hat{P_4})= n^2/8+O(n). We show that for sufficiently large nn, ex(n,K3,P4^)=⌊n2/8⌋ex(n,K_3,\hat{P_4})=\lfloor n^2/8\rfloor.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.