Planar Turán number of intersecting triangles

Abstract: The planar Tur'{a}n number of a given graph

H

, denoted by

e x_{m a t h c a l P} (n, H)

, is the maximum number of edges over all planar graphs on

n

vertices that do not contain a copy of

H

as a subgraph. Let

H_{k}

be a friendship graph, which is obtained from

k

triangles by sharing a common vertex. In this paper, we obtain sharp bounds of

e x_{m a t h c a l P} (n, H_{k})

and

e x_{m a t h c a l P} (n, K_{1} + P_{k + 1})

for

k g e 2

, which improves the results of Lan and Shi in Electron. J. Combin. 26 (2) (2019), #P2.11.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Planar Turán number of intersecting triangles