Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sharp planar Turán bounds for quasi-double stars

Published 5 Oct 2026 in math.CO | (2610.05706v1)

Abstract: We study WW-free planar graphs for W∈W2,4,W2,5,W3,4W\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/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/4$. We also establish the sharp upper bound $5n/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.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.