Abstract
The {\em planar Turán number} of , denoted by , is the maximum number of edges in an -free planar graph. The planar Turán number of vertex-disjoint union of cycles is a trivial value . Lan, Shi and Song determine the exact value of . We continue to study planar Turán number of vertex-disjoint union of cycles and obtain the exact value of , where is vertex-disjoint union of and . The extremal graphs are also characterized. We also improve the lower bound of when is sufficiently large.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.