Let F be a set of graphs. The planar Tur\'an number, exP(n,F), is the maximum number of edges in an n-vertex planar graph which does not contain any member of F as a subgraph. In this paper, we give upper bounds of exP(n,₄,Θ₅\)25/11(n-2). We also give constructions which show the bounds are tight for infinitely many graphs.
No takes yet. Share an insight, caveat, or question.
Tao Fang (2024) studied this question.