加载中…
Planar Turán number, denoted by , is the maximum number of edges in an -vertex planar graph which does not contain as a subgraph. Ghosh, Győri, Paulos and Xiao initiated the topic of the planar Turán number for double stars. For balanced double star, is the only remaining graph need to be considered. In this paper, we give the exact value of , forcing the planar Turán number for all balanced double stars completely determined.

生成讲解博客的中文版本

生成AI智能校验的中文版本