加载中…
Planar Turán number of 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. In this paper, we prove that for , and show that equality holds for infinitely many integers .

生成讲解博客的中文版本

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