Planar Turán number of disjoint union of C3C_3 and C4C_4

preprint2022arXivOpen access

Abstract

The {\em planar Turán number} of HH, denoted by exP(n,H)ex_{\mathcal{P}}(n,H), is the maximum number of edges in an HH-free planar graph. The planar Turán number of k≥3k\geq 3 vertex-disjoint union of cycles is a trivial value 3n−63n-6. Lan, Shi and Song determine the exact value of exP(n,2C3)ex_{\mathcal{P}}(n,2C_3). We continue to study planar Turán number of vertex-disjoint union of cycles and obtain the exact value of exP(n,H)ex_{\mathcal{P}}(n,H), where HH is vertex-disjoint union of C3C_3 and C4C_4. The extremal graphs are also characterized. We also improve the lower bound of exP(n,2Ck)ex_{\mathcal{P}}(n,2C_k) when kk is sufficiently large.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.