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

Let $G$ be a graph, and let $g$ and $f$ be two integer-valued functions defined on $V(G)$ satisfying $a\leq g(x)\leq f(x)-r\leq b-r$ for any $x\in V(G)$, where $a,b$ and $r$ be three nonnegative integers with $1\leq a\leq b-r$. In this article, we verify that $G$ contains a fractional $(g,f)$-factor if its connectivity $\kappa(G)$ and independence number $\alpha(G)$ satisfy $\kappa(G)\geq\max\{\frac{(b+1)(b-r+1)}{2},\frac{(b-r+1)^{2}\alpha(G)}{4(a+r)}\}$. The result is best possible in some sense.

Independence number, connectivity and fractional (g,f)-factors in graphs