首页|The Turan number of the triangular pyramid of 3-layers
The Turan number of the triangular pyramid of 3-layers
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
The Turan number of a graph H, denoted by ex(n, H), is the maximum number of edges in an n-vertex graph that does not have H as a subgraph. Let TPk be the triangular pyramid of k-layers. In this paper, we determine that ex(n, TP3) = 1/4n(2) + n + o(n) and pose a conjecture for ex(n, TP4). (C) 2022 Published by Elsevier B.V.
Turan numberTriangular pyramid of k-layers
Ghosh, Debarun、Gyori, Ervin、Paulos, Addisu、Xiao, Chuanqi、Zamora, Oscar
NSTL
Elsevier
