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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Tur\'an number of a graph $H$, $\text{ex}(n,H)$, is the maximum number ofedges in a graph on $n$ vertices which does not have $H$ as a subgraph. A wheel$W_n$ is an $n$-vertex graph formed by connecting a single vertex to allvertices of a cycle $C_{n-1}$. Let $mW_{2k+1}$ denote the $m$ vertex-disjointcopies of $W_{2k+1}$. For sufficiently large $n$, we determine the Tur\'annumber and all extremal graphs for $mW_{2k+1}$. We also provide the Tur\'annumber and all extremal graphs for $W^{h}:=\bigcup\limits^m_{i=1}W_{k_i}$ when$n$ is sufficiently large, where the number of even wheels is $h$ and $h>0$.

A note on the Tur\'an number of disjoint union of wheels