The planar Tur\'{a}n number of a graph H, denoted by exP(n,H), is the maximum number of edges in an n-vertex H-free planar graph. Recently, D. Ghosh, et al. initiated the topic of double stars and prove that exP(n,S2,5)≤ 20/7n. In this paper, we continue to study this and give a sharp upper bound exP(n,S2,5)≤ 19/7n-18/7 for all n≥ 1, with equality when $n=12$. This improves Ghosh's result.
No takes yet. Share an insight, caveat, or question.
Xu et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: