Planar Turán numbers of cubic graphs and disjoint union of cycles

preprint2022arXivOpen access

Abstract

The planar Turán number of a graph HH, denoted exP(n,H)ex_{_\mathcal{P}}(n,H), is the maximum number of edges in a planar graph on nn vertices without containing HH as a subgraph. This notion was introduced by Dowden in 2016 and has attracted quite some attention since then; those work mainly focus on finding exP(n,H)ex_{_\mathcal{P}}(n,H) when HH is a cycle or Theta graph or HH has maximum degree at least four. In this paper, we study exP(n,H)ex_{_\mathcal{P}}(n,H) when HH is a cubic graph or disjoint union of cycles or H=Ks,tH=K_{s, t}.

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.