Sharp planar Turán bounds for quasi-double stars
Zehui Shao, Enqiang Zhu, Shaohui Wang
Source abstract
We study -free planar graphs for , where the quasi-double star is obtained from a three-vertex path by attaching leaves to one endpoint and leaves to the other. We prove that every -free planar graph on vertices has at most edges, and the bound is attained whenever . This determines the planar Turán density of as . We also establish the sharp upper bound for . Combined with known constructions of planar graphs of maximum degree five, it yields $\ex_{\PP}(n,W_{2,5})=\lfloor5n/2\rfloor$ for every . These results close the two corresponding coefficient gaps in the bounds of Liu et~al. Our proofs use structural restrictions on high-degree vertices, local deletions, and degree deficits in neighborhoods of radius two. For , we characterize the planar graphs with a dominating vertex that avoid this tree and determine their exact extremal number, , for every . Finally, -free planar triangulations have at most eight, twelve, and eleven vertices for , respectively; the first two bounds are sharp.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.