No Detail Found!

Anote on the numberof triangles in graphs without the suspension of a pathon four vertices

Author(s)
Daniel Gerbner Alfr´ed R´enyi Institute of Mathematics, Budapest, Hungary
Abstract
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 P^4. The largest number of triangles in a P^4-free n-vertex graph is denoted by ex(n; K3; P^4). Mubayi and Mukherjee showed in the preprint [arXiv:2004.11930, (2020)] that ex(n; K3; P^4) = n2=8 + O(n). For sufficiently large n, it is shown here that ex(n; K3; P^4) = bn2=8c.
Publication Details
Page(s) 32-34
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
generalized Tura´ n problems, suspension of a graph, Berge hypergraph
0

Citations

0

Downloads

169

Views