Abstract
The suspension of the path consists of a and an additional vertex connected to each of the four vertices, and is denoted by . The largest number of triangles in a -free -vertex graph is denoted by . Mubayi and Mukherjee in 2020 showed that . We show that for sufficiently large , .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.