Indexed metadata

Sharp planar Turán bounds for quasi-double stars

Zehui Shao, Enqiang Zhu, Shaohui Wang

Source record

Source: arXiv

Published: Oct 5, 2026

arXiv: 2610.05706

Open original source ↗

Source abstract

We study WW-free planar graphs for W∈{W2,4,W2,5,W3,4}W\in\{W_{2,4},W_{2,5},W_{3,4}\}, where the quasi-double star Wh,kW_{h,k} is obtained from a three-vertex path by attaching hh leaves to one endpoint and kk leaves to the other. We prove that every W2,4W_{2,4}-free planar graph on nn vertices has at most 9n/49n/4 edges, and the bound is attained whenever 8∣n8\mid n. This determines the planar Turán density of W2,4W_{2,4} as 9/49/4. We also establish the sharp upper bound 5n/25n/2 for W2,5W_{2,5}. Combined with known constructions of planar graphs of maximum degree five, it yields $\ex_{\PP}(n,W_{2,5})=\lfloor5n/2\rfloor$ for every n≥15n\ge15. 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 W3,4W_{3,4}, we characterize the planar graphs with a dominating vertex that avoid this tree and determine their exact extremal number, ⌊(5n−7)/2⌋\lfloor(5n-7)/2\rfloor, for every n≥10n\ge10. Finally, WW-free planar triangulations have at most eight, twelve, and eleven vertices for W=W2,4,W2,5,W3,4W=W_{2,4},W_{2,5},W_{3,4}, 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.

Sharp planar Turán bounds for quasi-double stars — Mathematical Frontier Network