English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The {\em planar Tur\'{a}n number} of $H$, denoted by $ex_{\mathcal{P}}(n,H)$,is the maximum number of edges in an $H$-free planar graph. The planarTur\'{a}n number of $k\geq 3$ vertex-disjoint union of cycles is a trivialvalue $3n-6$. Lan, Shi and Song determine the exact value of$ex_{\mathcal{P}}(n,2C_3)$. We continue to study planar Tur\'{a}n number ofvertex-disjoint union of cycles and obtain the exact value of$ex_{\mathcal{P}}(n,H)$, where $H$ is vertex-disjoint union of $C_3$ and $C_4$.The extremal graphs are also characterized. We also improve the lower bound of$ex_{\mathcal{P}}(n,2C_k)$ when $k$ is sufficiently large.

Planar Tur\'{a}n number of disjoint union of $C_3$ and $C_4$