arXiv:2505.11105 [math.CO]AbstractReferencesReviewsResources
On the Turán number of the expansion of the $t$-fan
Xin Cheng, Dániel Gerbner, Hilal Hama Karim, Junpeng Zhou
Published 2025-05-16Version 1
The $t$-fan is the graph on $2t+1$ vertices consisting of $t$ triangles which intersect at exactly one common vertex. For a given graph $F$, the $r$-expansion $F^r$ of $F$ is the $r$-uniform hypergraph obtained from $F$ by adding $r-2$ distinct new vertices to each edge of $F$. We determine the Tur\'an number of the 3-expansion of the $t$-fan for sufficiently large $n$.
Comments: 14 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2003.04450 [math.CO] (Published 2020-03-09)
The number of triangles is more when they have no common vertex
Maximum hitting for n sufficiently large
arXiv:1702.01355 [math.CO] (Published 2017-02-05)
Graphs without large $K_{2,n}$-minors