The planar Turán number of double star
arXiv:2409.01016 · doi:10.1016/j.disc.2025.114571
Abstract
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 .