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

Given a family of graphs $\mathcal{F}$, a graph $G$ is said to be$\mathcal{F}$-saturated if $G$ does not contain a copy of $F$ as a subgraph forany $F\in\mathcal{F}$ but the addition of any edge $e\notin E(G)$ creates atleast one copy of some $F\in\mathcal{F}$ within $G$. The minimum size of an$\mathcal{F}$-saturated graph on $n$ vertices are called the saturation number,denoted by $\sat(n, \mathcal{F})$. Let $\mathcal{C}_{\ge r}$ be the family ofcycles of length at least $r$. Ferrara et al. (2012) gave lower and upperbounds of $\sat(n, C_{\ge r})$ and determined the exact values of $\sat(n,C_{\ge r})$ for $3\le r\le 5$. In this paper, we determine the exact value of$\sat(n,\mathcal{C}_{\ge r})$ for $r=6$ and $28\le \frac{n}2\le r\le n$ andgive new upper and lower bounds for the other cases.

Minimizing the number of edges in $\mathcal{C}_{\ge r}$-saturated graphs