Planar Tur\'an number exP(n,H) of H is the maximum number of edges in an n-vertex planar graph which does not contain H as a subgraph. Ghosh, Gy{o}ri, Paulos and Xiao initiated the topic of the planar Tur\'an number for double stars. In this paper, we prove that exP(n,S2,4)≤ 31/14n for n≥ 1, and show that equality holds for infinitely many integers n.
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: