Planar Turán number of double star $ S_{3, 4} $

Star (game theory)
DOI: 10.3934/math.2025075 Publication Date: 2025-01-24T00:45:43Z
ABSTRACT
<p>Planar Turán number, denoted by $ \mathrm{ex}_{\mathcal{P}}(n, H) $, is the maximum number of edges in an n $-vertex planar graph which does not contain H as a subgraph. Ghosh, Győri, Paulos and Xiao initiated topic for double stars. There were two stars S_{3, 4} 5} that remained unknown. In this paper, we give exact value 4}) $.</p>
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (22)
CITATIONS (0)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....