Planar Turán Numbers of Short Paths
Planar Turán Numbers of Short Paths
复制标题
DOI：
10.1007/s00373-019-02055-w
复制
发表时间：
2019-06
影响因子：
0.7
通讯作者：
Yongxin Lan;Yongtang Shi
中科院分区：
文献类型：
--
作者：
Yongxin Lan;Yongtang Shi
Given a graphH, the planar Turán number ofH, denotedis the maximum number of edges in anH-free planar graph onnvertices. The idea of determiningwas promoted by Lan, Song and Shi, in which they obtained that the planar Turán number of pathswith. In this paper, we determine the planar Turán number of pathswith.
